./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/cstrncpy-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3eefb476-cbdb-4690-a5a6-4e3d33423b3d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3eefb476-cbdb-4690-a5a6-4e3d33423b3d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3eefb476-cbdb-4690-a5a6-4e3d33423b3d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3eefb476-cbdb-4690-a5a6-4e3d33423b3d/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/cstrncpy-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3eefb476-cbdb-4690-a5a6-4e3d33423b3d/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3eefb476-cbdb-4690-a5a6-4e3d33423b3d/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 a42c021ebd0de645918b065980a1f8d912cba85d ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 00:42:39,238 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 00:42:39,239 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 00:42:39,247 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 00:42:39,247 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 00:42:39,247 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 00:42:39,248 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 00:42:39,249 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 00:42:39,249 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 00:42:39,250 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 00:42:39,250 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 00:42:39,250 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 00:42:39,251 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 00:42:39,251 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 00:42:39,252 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 00:42:39,252 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 00:42:39,252 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 00:42:39,253 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 00:42:39,254 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 00:42:39,255 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 00:42:39,255 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 00:42:39,256 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 00:42:39,258 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 00:42:39,258 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 00:42:39,258 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 00:42:39,259 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 00:42:39,259 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 00:42:39,260 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 00:42:39,260 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 00:42:39,260 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 00:42:39,261 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 00:42:39,261 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 00:42:39,261 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 00:42:39,261 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 00:42:39,261 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 00:42:39,262 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 00:42:39,262 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3eefb476-cbdb-4690-a5a6-4e3d33423b3d/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-12-09 00:42:39,269 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 00:42:39,269 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 00:42:39,269 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 00:42:39,269 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 00:42:39,270 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 00:42:39,270 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 00:42:39,270 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 00:42:39,270 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 00:42:39,270 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 00:42:39,271 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 00:42:39,271 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 00:42:39,271 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 00:42:39,271 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 00:42:39,271 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 00:42:39,271 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 00:42:39,271 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 00:42:39,272 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 00:42:39,272 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 00:42:39,272 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 00:42:39,272 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 00:42:39,272 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 00:42:39,272 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 00:42:39,273 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 00:42:39,273 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 00:42:39,273 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 00:42:39,273 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 00:42:39,273 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 00:42:39,273 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 00:42:39,273 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_3eefb476-cbdb-4690-a5a6-4e3d33423b3d/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 -> a42c021ebd0de645918b065980a1f8d912cba85d [2018-12-09 00:42:39,296 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 00:42:39,303 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 00:42:39,305 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 00:42:39,306 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 00:42:39,306 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 00:42:39,306 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3eefb476-cbdb-4690-a5a6-4e3d33423b3d/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-12-09 00:42:39,341 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3eefb476-cbdb-4690-a5a6-4e3d33423b3d/bin-2019/uautomizer/data/8d6286ef8/c5d82f3908e1491896be6f2101a692cb/FLAGfcc149042 [2018-12-09 00:42:39,672 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 00:42:39,673 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3eefb476-cbdb-4690-a5a6-4e3d33423b3d/sv-benchmarks/c/array-memsafety/cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-12-09 00:42:39,680 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3eefb476-cbdb-4690-a5a6-4e3d33423b3d/bin-2019/uautomizer/data/8d6286ef8/c5d82f3908e1491896be6f2101a692cb/FLAGfcc149042 [2018-12-09 00:42:40,069 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3eefb476-cbdb-4690-a5a6-4e3d33423b3d/bin-2019/uautomizer/data/8d6286ef8/c5d82f3908e1491896be6f2101a692cb [2018-12-09 00:42:40,071 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 00:42:40,072 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-09 00:42:40,073 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 00:42:40,073 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 00:42:40,076 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 00:42:40,076 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:42:40" (1/1) ... [2018-12-09 00:42:40,078 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23ef7631 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:42:40, skipping insertion in model container [2018-12-09 00:42:40,078 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:42:40" (1/1) ... [2018-12-09 00:42:40,083 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 00:42:40,103 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 00:42:40,241 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:42:40,248 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 00:42:40,309 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:42:40,329 INFO L195 MainTranslator]: Completed translation [2018-12-09 00:42:40,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:42:40 WrapperNode [2018-12-09 00:42:40,329 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 00:42:40,329 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 00:42:40,329 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 00:42:40,330 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 00:42:40,337 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:42:40" (1/1) ... [2018-12-09 00:42:40,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:42:40" (1/1) ... [2018-12-09 00:42:40,345 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:42:40" (1/1) ... [2018-12-09 00:42:40,345 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:42:40" (1/1) ... [2018-12-09 00:42:40,351 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:42:40" (1/1) ... [2018-12-09 00:42:40,354 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:42:40" (1/1) ... [2018-12-09 00:42:40,355 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:42:40" (1/1) ... [2018-12-09 00:42:40,358 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 00:42:40,358 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 00:42:40,358 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 00:42:40,358 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 00:42:40,359 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:42:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eefb476-cbdb-4690-a5a6-4e3d33423b3d/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 00:42:40,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 00:42:40,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 00:42:40,389 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-12-09 00:42:40,389 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-12-09 00:42:40,390 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrncpy [2018-12-09 00:42:40,390 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 00:42:40,390 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-12-09 00:42:40,390 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-12-09 00:42:40,390 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-09 00:42:40,390 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-09 00:42:40,390 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-09 00:42:40,390 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-09 00:42:40,390 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-09 00:42:40,390 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-09 00:42:40,390 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-09 00:42:40,390 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-09 00:42:40,390 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-09 00:42:40,390 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-09 00:42:40,390 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-09 00:42:40,391 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-09 00:42:40,391 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-09 00:42:40,391 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-09 00:42:40,391 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-09 00:42:40,391 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-09 00:42:40,391 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-09 00:42:40,391 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-09 00:42:40,391 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-09 00:42:40,391 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-09 00:42:40,391 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-09 00:42:40,391 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-09 00:42:40,391 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-09 00:42:40,391 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-09 00:42:40,391 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-09 00:42:40,392 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-09 00:42:40,392 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-09 00:42:40,392 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-09 00:42:40,392 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-09 00:42:40,392 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-09 00:42:40,392 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-09 00:42:40,392 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-09 00:42:40,392 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-09 00:42:40,392 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-09 00:42:40,392 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-09 00:42:40,392 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-09 00:42:40,392 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-09 00:42:40,392 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-09 00:42:40,392 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-09 00:42:40,392 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-09 00:42:40,393 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-09 00:42:40,393 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-09 00:42:40,393 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-09 00:42:40,393 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-09 00:42:40,393 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-09 00:42:40,393 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-09 00:42:40,393 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-09 00:42:40,393 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-09 00:42:40,393 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-09 00:42:40,393 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-09 00:42:40,393 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-09 00:42:40,393 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-09 00:42:40,393 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-09 00:42:40,393 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-09 00:42:40,393 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-09 00:42:40,393 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-09 00:42:40,394 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-09 00:42:40,394 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-09 00:42:40,394 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-09 00:42:40,394 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-09 00:42:40,394 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-09 00:42:40,394 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-09 00:42:40,394 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-09 00:42:40,394 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-09 00:42:40,394 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-09 00:42:40,394 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-09 00:42:40,394 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-09 00:42:40,394 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-09 00:42:40,394 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-09 00:42:40,395 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-09 00:42:40,395 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-09 00:42:40,395 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-09 00:42:40,395 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-09 00:42:40,395 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-09 00:42:40,395 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-09 00:42:40,395 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-09 00:42:40,395 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-09 00:42:40,395 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-09 00:42:40,395 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-09 00:42:40,395 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-09 00:42:40,395 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-09 00:42:40,395 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-09 00:42:40,396 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-09 00:42:40,396 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-09 00:42:40,396 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-09 00:42:40,396 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-09 00:42:40,396 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-09 00:42:40,396 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-09 00:42:40,396 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-09 00:42:40,396 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-09 00:42:40,396 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-09 00:42:40,396 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-09 00:42:40,396 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-09 00:42:40,396 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-09 00:42:40,396 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-09 00:42:40,396 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-09 00:42:40,396 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-09 00:42:40,396 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-09 00:42:40,397 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-09 00:42:40,397 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-09 00:42:40,397 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-12-09 00:42:40,397 INFO L130 BoogieDeclarations]: Found specification of procedure cstrncpy [2018-12-09 00:42:40,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 00:42:40,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 00:42:40,397 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 00:42:40,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 00:42:40,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 00:42:40,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 00:42:40,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 00:42:40,582 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 00:42:40,582 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-09 00:42:40,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:42:40 BoogieIcfgContainer [2018-12-09 00:42:40,583 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 00:42:40,583 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 00:42:40,583 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 00:42:40,585 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 00:42:40,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 12:42:40" (1/3) ... [2018-12-09 00:42:40,585 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50f2f944 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:42:40, skipping insertion in model container [2018-12-09 00:42:40,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:42:40" (2/3) ... [2018-12-09 00:42:40,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50f2f944 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:42:40, skipping insertion in model container [2018-12-09 00:42:40,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:42:40" (3/3) ... [2018-12-09 00:42:40,587 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-12-09 00:42:40,592 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 00:42:40,597 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-12-09 00:42:40,606 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2018-12-09 00:42:40,620 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 00:42:40,621 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 00:42:40,621 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 00:42:40,621 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 00:42:40,621 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 00:42:40,621 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 00:42:40,621 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 00:42:40,621 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 00:42:40,621 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 00:42:40,631 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-12-09 00:42:40,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 00:42:40,638 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:40,639 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:42:40,640 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 00:42:40,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:40,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1056841845, now seen corresponding path program 1 times [2018-12-09 00:42:40,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:42:40,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:42:40,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:40,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:40,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:40,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:40,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:40,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:40,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 00:42:40,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:42:40,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:42:40,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:42:40,757 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 3 states. [2018-12-09 00:42:40,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:40,786 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-12-09 00:42:40,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:42:40,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-09 00:42:40,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:40,795 INFO L225 Difference]: With dead ends: 36 [2018-12-09 00:42:40,795 INFO L226 Difference]: Without dead ends: 33 [2018-12-09 00:42:40,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:42:40,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-09 00:42:40,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-09 00:42:40,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-09 00:42:40,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-12-09 00:42:40,817 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 10 [2018-12-09 00:42:40,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:40,817 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-12-09 00:42:40,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:42:40,817 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-12-09 00:42:40,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 00:42:40,817 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:40,817 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:42:40,817 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 00:42:40,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:40,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1056841844, now seen corresponding path program 1 times [2018-12-09 00:42:40,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:42:40,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:42:40,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:40,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:40,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:40,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:40,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:40,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:40,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:42:40,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:42:40,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:42:40,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:42:40,863 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 4 states. [2018-12-09 00:42:40,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:40,880 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-12-09 00:42:40,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:42:40,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-09 00:42:40,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:40,881 INFO L225 Difference]: With dead ends: 32 [2018-12-09 00:42:40,881 INFO L226 Difference]: Without dead ends: 32 [2018-12-09 00:42:40,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:42:40,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-09 00:42:40,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-09 00:42:40,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-09 00:42:40,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-12-09 00:42:40,885 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 10 [2018-12-09 00:42:40,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:40,886 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-12-09 00:42:40,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:42:40,886 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-12-09 00:42:40,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 00:42:40,886 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:40,887 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:42:40,887 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 00:42:40,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:40,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1498133944, now seen corresponding path program 1 times [2018-12-09 00:42:40,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:42:40,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:42:40,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:40,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:40,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:40,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:40,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:40,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:40,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 00:42:40,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 00:42:40,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 00:42:40,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:42:40,961 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 8 states. [2018-12-09 00:42:41,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:41,028 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2018-12-09 00:42:41,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:42:41,028 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-12-09 00:42:41,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:41,030 INFO L225 Difference]: With dead ends: 42 [2018-12-09 00:42:41,030 INFO L226 Difference]: Without dead ends: 42 [2018-12-09 00:42:41,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-12-09 00:42:41,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-09 00:42:41,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2018-12-09 00:42:41,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-09 00:42:41,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2018-12-09 00:42:41,034 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 14 [2018-12-09 00:42:41,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:41,035 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2018-12-09 00:42:41,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 00:42:41,035 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2018-12-09 00:42:41,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 00:42:41,035 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:41,035 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:42:41,035 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 00:42:41,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:41,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1498133945, now seen corresponding path program 1 times [2018-12-09 00:42:41,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:42:41,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:42:41,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:41,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:41,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:41,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:41,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:41,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:41,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:42:41,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:42:41,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:42:41,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:42:41,064 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 6 states. [2018-12-09 00:42:41,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:41,105 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2018-12-09 00:42:41,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:42:41,105 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-12-09 00:42:41,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:41,106 INFO L225 Difference]: With dead ends: 33 [2018-12-09 00:42:41,106 INFO L226 Difference]: Without dead ends: 33 [2018-12-09 00:42:41,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:42:41,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-09 00:42:41,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-09 00:42:41,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-09 00:42:41,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2018-12-09 00:42:41,109 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 14 [2018-12-09 00:42:41,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:41,109 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2018-12-09 00:42:41,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:42:41,109 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2018-12-09 00:42:41,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 00:42:41,109 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:41,109 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:42:41,109 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 00:42:41,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:41,110 INFO L82 PathProgramCache]: Analyzing trace with hash 802487948, now seen corresponding path program 1 times [2018-12-09 00:42:41,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:42:41,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:42:41,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:41,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:41,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:41,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:41,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:41,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:41,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:42:41,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 00:42:41,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 00:42:41,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:42:41,156 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 7 states. [2018-12-09 00:42:41,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:41,192 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2018-12-09 00:42:41,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:42:41,193 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-12-09 00:42:41,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:41,193 INFO L225 Difference]: With dead ends: 32 [2018-12-09 00:42:41,193 INFO L226 Difference]: Without dead ends: 32 [2018-12-09 00:42:41,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:42:41,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-09 00:42:41,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-09 00:42:41,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-09 00:42:41,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-12-09 00:42:41,195 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 15 [2018-12-09 00:42:41,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:41,196 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-12-09 00:42:41,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 00:42:41,196 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-12-09 00:42:41,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 00:42:41,196 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:41,196 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:42:41,196 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 00:42:41,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:41,197 INFO L82 PathProgramCache]: Analyzing trace with hash 802487949, now seen corresponding path program 1 times [2018-12-09 00:42:41,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:42:41,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:42:41,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:41,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:41,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:41,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:41,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:41,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:41,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:42:41,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 00:42:41,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 00:42:41,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:42:41,241 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 7 states. [2018-12-09 00:42:41,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:41,292 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2018-12-09 00:42:41,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:42:41,293 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-12-09 00:42:41,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:41,293 INFO L225 Difference]: With dead ends: 37 [2018-12-09 00:42:41,293 INFO L226 Difference]: Without dead ends: 37 [2018-12-09 00:42:41,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:42:41,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-09 00:42:41,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2018-12-09 00:42:41,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-09 00:42:41,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2018-12-09 00:42:41,297 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 15 [2018-12-09 00:42:41,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:41,297 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2018-12-09 00:42:41,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 00:42:41,297 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2018-12-09 00:42:41,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 00:42:41,297 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:41,297 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:42:41,297 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 00:42:41,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:41,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1102767525, now seen corresponding path program 1 times [2018-12-09 00:42:41,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:42:41,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:42:41,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:41,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:41,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:41,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:41,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:41,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:41,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:42:41,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:42:41,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:42:41,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:42:41,321 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 5 states. [2018-12-09 00:42:41,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:41,335 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-12-09 00:42:41,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 00:42:41,335 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-12-09 00:42:41,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:41,336 INFO L225 Difference]: With dead ends: 36 [2018-12-09 00:42:41,336 INFO L226 Difference]: Without dead ends: 33 [2018-12-09 00:42:41,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:42:41,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-09 00:42:41,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-09 00:42:41,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-09 00:42:41,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-12-09 00:42:41,338 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 18 [2018-12-09 00:42:41,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:41,338 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-12-09 00:42:41,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:42:41,338 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-12-09 00:42:41,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 00:42:41,339 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:41,339 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:42:41,339 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 00:42:41,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:41,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1130499361, now seen corresponding path program 1 times [2018-12-09 00:42:41,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:42:41,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:42:41,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:41,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:41,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:41,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:41,372 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:41,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:41,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:42:41,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:42:41,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:42:41,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:42:41,373 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 6 states. [2018-12-09 00:42:41,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:41,397 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2018-12-09 00:42:41,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:42:41,398 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-12-09 00:42:41,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:41,398 INFO L225 Difference]: With dead ends: 57 [2018-12-09 00:42:41,398 INFO L226 Difference]: Without dead ends: 57 [2018-12-09 00:42:41,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:42:41,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-09 00:42:41,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 49. [2018-12-09 00:42:41,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-09 00:42:41,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2018-12-09 00:42:41,401 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 18 [2018-12-09 00:42:41,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:41,401 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2018-12-09 00:42:41,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:42:41,402 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2018-12-09 00:42:41,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 00:42:41,402 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:41,402 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:42:41,402 INFO L423 AbstractCegarLoop]: === Iteration 9 === [cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 00:42:41,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:41,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1831563939, now seen corresponding path program 1 times [2018-12-09 00:42:41,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:42:41,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:42:41,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:41,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:41,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:41,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:41,482 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:41,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:41,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 00:42:41,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 00:42:41,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 00:42:41,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:42:41,483 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 9 states. [2018-12-09 00:42:41,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:41,548 INFO L93 Difference]: Finished difference Result 85 states and 97 transitions. [2018-12-09 00:42:41,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 00:42:41,548 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-12-09 00:42:41,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:41,549 INFO L225 Difference]: With dead ends: 85 [2018-12-09 00:42:41,549 INFO L226 Difference]: Without dead ends: 85 [2018-12-09 00:42:41,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-12-09 00:42:41,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-09 00:42:41,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 65. [2018-12-09 00:42:41,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-09 00:42:41,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2018-12-09 00:42:41,555 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 18 [2018-12-09 00:42:41,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:41,556 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2018-12-09 00:42:41,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 00:42:41,556 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2018-12-09 00:42:41,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 00:42:41,557 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:41,557 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:42:41,557 INFO L423 AbstractCegarLoop]: === Iteration 10 === [cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 00:42:41,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:41,557 INFO L82 PathProgramCache]: Analyzing trace with hash 2089729377, now seen corresponding path program 1 times [2018-12-09 00:42:41,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:42:41,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:42:41,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:41,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:41,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:41,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:41,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:41,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:42:41,706 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eefb476-cbdb-4690-a5a6-4e3d33423b3d/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:42:41,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:41,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:41,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:42:41,769 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 14 treesize of output 11 [2018-12-09 00:42:41,772 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 11 treesize of output 10 [2018-12-09 00:42:41,772 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:42:41,774 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:42:41,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:42:41,781 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-09 00:42:41,884 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 20 treesize of output 16 [2018-12-09 00:42:41,890 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 16 treesize of output 13 [2018-12-09 00:42:41,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 00:42:41,893 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 00:42:41,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 00:42:41,901 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-12-09 00:42:41,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:41,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:42:41,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2018-12-09 00:42:41,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-09 00:42:41,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-09 00:42:41,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-12-09 00:42:41,947 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. Second operand 16 states. [2018-12-09 00:42:42,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:42,233 INFO L93 Difference]: Finished difference Result 77 states and 92 transitions. [2018-12-09 00:42:42,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 00:42:42,234 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-12-09 00:42:42,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:42,235 INFO L225 Difference]: With dead ends: 77 [2018-12-09 00:42:42,235 INFO L226 Difference]: Without dead ends: 77 [2018-12-09 00:42:42,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2018-12-09 00:42:42,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-09 00:42:42,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 68. [2018-12-09 00:42:42,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-09 00:42:42,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2018-12-09 00:42:42,239 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 82 transitions. Word has length 18 [2018-12-09 00:42:42,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:42,239 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 82 transitions. [2018-12-09 00:42:42,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-09 00:42:42,239 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 82 transitions. [2018-12-09 00:42:42,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 00:42:42,239 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:42,239 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:42:42,240 INFO L423 AbstractCegarLoop]: === Iteration 11 === [cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 00:42:42,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:42,240 INFO L82 PathProgramCache]: Analyzing trace with hash 685189778, now seen corresponding path program 1 times [2018-12-09 00:42:42,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:42:42,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:42:42,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:42,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:42,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:42,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:42,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-12-09 00:42:42,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:42,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:42:42,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:42:42,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:42:42,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:42:42,268 INFO L87 Difference]: Start difference. First operand 68 states and 82 transitions. Second operand 6 states. [2018-12-09 00:42:42,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:42,308 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2018-12-09 00:42:42,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:42:42,309 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-12-09 00:42:42,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:42,309 INFO L225 Difference]: With dead ends: 73 [2018-12-09 00:42:42,309 INFO L226 Difference]: Without dead ends: 73 [2018-12-09 00:42:42,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:42:42,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-09 00:42:42,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2018-12-09 00:42:42,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-09 00:42:42,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2018-12-09 00:42:42,313 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 19 [2018-12-09 00:42:42,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:42,313 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2018-12-09 00:42:42,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:42:42,313 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2018-12-09 00:42:42,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 00:42:42,314 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:42,314 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:42:42,314 INFO L423 AbstractCegarLoop]: === Iteration 12 === [cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 00:42:42,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:42,315 INFO L82 PathProgramCache]: Analyzing trace with hash 685189779, now seen corresponding path program 1 times [2018-12-09 00:42:42,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:42:42,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:42:42,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:42,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:42,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:42,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:42,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:42,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:42,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 00:42:42,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 00:42:42,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 00:42:42,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:42:42,373 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand 8 states. [2018-12-09 00:42:42,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:42,420 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2018-12-09 00:42:42,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 00:42:42,421 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-12-09 00:42:42,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:42,421 INFO L225 Difference]: With dead ends: 81 [2018-12-09 00:42:42,421 INFO L226 Difference]: Without dead ends: 81 [2018-12-09 00:42:42,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-12-09 00:42:42,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-09 00:42:42,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2018-12-09 00:42:42,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-09 00:42:42,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2018-12-09 00:42:42,425 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 19 [2018-12-09 00:42:42,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:42,425 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2018-12-09 00:42:42,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 00:42:42,425 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2018-12-09 00:42:42,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 00:42:42,425 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:42,425 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:42:42,425 INFO L423 AbstractCegarLoop]: === Iteration 13 === [cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 00:42:42,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:42,426 INFO L82 PathProgramCache]: Analyzing trace with hash 943355217, now seen corresponding path program 1 times [2018-12-09 00:42:42,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:42:42,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:42:42,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:42,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:42,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:42,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:42,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:42,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:42,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 00:42:42,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 00:42:42,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 00:42:42,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-12-09 00:42:42,524 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand 12 states. [2018-12-09 00:42:42,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:42,682 INFO L93 Difference]: Finished difference Result 89 states and 100 transitions. [2018-12-09 00:42:42,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 00:42:42,682 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-12-09 00:42:42,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:42,683 INFO L225 Difference]: With dead ends: 89 [2018-12-09 00:42:42,683 INFO L226 Difference]: Without dead ends: 89 [2018-12-09 00:42:42,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2018-12-09 00:42:42,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-09 00:42:42,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 84. [2018-12-09 00:42:42,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-09 00:42:42,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 96 transitions. [2018-12-09 00:42:42,687 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 96 transitions. Word has length 19 [2018-12-09 00:42:42,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:42,687 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 96 transitions. [2018-12-09 00:42:42,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 00:42:42,688 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 96 transitions. [2018-12-09 00:42:42,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 00:42:42,688 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:42,688 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:42:42,689 INFO L423 AbstractCegarLoop]: === Iteration 14 === [cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 00:42:42,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:42,689 INFO L82 PathProgramCache]: Analyzing trace with hash 357101204, now seen corresponding path program 1 times [2018-12-09 00:42:42,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:42:42,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:42:42,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:42,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:42,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:42,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:42,743 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:42,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:42:42,743 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eefb476-cbdb-4690-a5a6-4e3d33423b3d/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:42:42,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:42,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:42,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:42:42,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 00:42:42,779 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 00:42:42,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-09 00:42:42,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 00:42:42,787 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 00:42:42,793 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:42:42,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:42:42,797 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2018-12-09 00:42:42,865 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:42,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:42:42,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-12-09 00:42:42,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 00:42:42,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 00:42:42,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-12-09 00:42:42,891 INFO L87 Difference]: Start difference. First operand 84 states and 96 transitions. Second operand 14 states. [2018-12-09 00:42:43,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:43,029 INFO L93 Difference]: Finished difference Result 96 states and 111 transitions. [2018-12-09 00:42:43,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 00:42:43,030 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 19 [2018-12-09 00:42:43,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:43,030 INFO L225 Difference]: With dead ends: 96 [2018-12-09 00:42:43,030 INFO L226 Difference]: Without dead ends: 96 [2018-12-09 00:42:43,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2018-12-09 00:42:43,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-09 00:42:43,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 83. [2018-12-09 00:42:43,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-09 00:42:43,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 95 transitions. [2018-12-09 00:42:43,035 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 95 transitions. Word has length 19 [2018-12-09 00:42:43,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:43,035 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 95 transitions. [2018-12-09 00:42:43,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 00:42:43,035 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 95 transitions. [2018-12-09 00:42:43,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 00:42:43,036 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:43,036 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:42:43,036 INFO L423 AbstractCegarLoop]: === Iteration 15 === [cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 00:42:43,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:43,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1020088252, now seen corresponding path program 1 times [2018-12-09 00:42:43,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:42:43,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:42:43,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:43,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:43,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:43,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:43,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 00:42:43,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:43,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:42:43,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:42:43,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:42:43,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:42:43,076 INFO L87 Difference]: Start difference. First operand 83 states and 95 transitions. Second operand 4 states. [2018-12-09 00:42:43,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:43,103 INFO L93 Difference]: Finished difference Result 82 states and 94 transitions. [2018-12-09 00:42:43,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:42:43,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-12-09 00:42:43,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:43,104 INFO L225 Difference]: With dead ends: 82 [2018-12-09 00:42:43,104 INFO L226 Difference]: Without dead ends: 47 [2018-12-09 00:42:43,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:42:43,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-09 00:42:43,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2018-12-09 00:42:43,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-09 00:42:43,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-12-09 00:42:43,105 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 22 [2018-12-09 00:42:43,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:43,105 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-12-09 00:42:43,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:42:43,105 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-12-09 00:42:43,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 00:42:43,106 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:43,106 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:42:43,106 INFO L423 AbstractCegarLoop]: === Iteration 16 === [cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 00:42:43,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:43,106 INFO L82 PathProgramCache]: Analyzing trace with hash -232043590, now seen corresponding path program 2 times [2018-12-09 00:42:43,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:42:43,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:42:43,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:43,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:43,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:43,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:43,299 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:43,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:42:43,299 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eefb476-cbdb-4690-a5a6-4e3d33423b3d/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:42:43,305 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 00:42:43,319 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 00:42:43,319 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 00:42:43,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:42:43,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 00:42:43,328 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 00:42:43,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-09 00:42:43,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 00:42:43,336 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 00:42:43,340 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:42:43,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:42:43,349 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2018-12-09 00:42:43,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-09 00:42:43,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-12-09 00:42:43,366 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:42:43,367 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:42:43,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:42:43,372 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-12-09 00:42:43,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-12-09 00:42:43,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 00:42:43,475 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:42:43,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:42:43,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:42:43,484 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:22 [2018-12-09 00:42:43,532 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 22 treesize of output 18 [2018-12-09 00:42:43,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-12-09 00:42:43,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 00:42:43,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 00:42:43,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 00:42:43,547 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-12-09 00:42:43,580 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:43,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:42:43,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-12-09 00:42:43,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-09 00:42:43,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-09 00:42:43,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2018-12-09 00:42:43,596 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 22 states. [2018-12-09 00:42:44,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:44,293 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-12-09 00:42:44,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 00:42:44,294 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2018-12-09 00:42:44,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:44,295 INFO L225 Difference]: With dead ends: 49 [2018-12-09 00:42:44,295 INFO L226 Difference]: Without dead ends: 49 [2018-12-09 00:42:44,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=158, Invalid=1032, Unknown=0, NotChecked=0, Total=1190 [2018-12-09 00:42:44,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-09 00:42:44,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 33. [2018-12-09 00:42:44,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-09 00:42:44,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-12-09 00:42:44,301 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 22 [2018-12-09 00:42:44,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:44,301 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-12-09 00:42:44,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-09 00:42:44,301 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-12-09 00:42:44,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 00:42:44,302 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:44,302 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] [2018-12-09 00:42:44,303 INFO L423 AbstractCegarLoop]: === Iteration 17 === [cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 00:42:44,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:44,303 INFO L82 PathProgramCache]: Analyzing trace with hash 6421641, now seen corresponding path program 1 times [2018-12-09 00:42:44,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:42:44,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:42:44,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:44,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:42:44,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:44,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:44,439 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:44,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:42:44,439 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eefb476-cbdb-4690-a5a6-4e3d33423b3d/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:42:44,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:44,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:44,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:42:44,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 00:42:44,468 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 00:42:44,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-09 00:42:44,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 00:42:44,478 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 00:42:44,482 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:42:44,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:42:44,491 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2018-12-09 00:42:44,652 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:44,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:42:44,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2018-12-09 00:42:44,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-09 00:42:44,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-09 00:42:44,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=456, Unknown=0, NotChecked=0, Total=506 [2018-12-09 00:42:44,667 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 23 states. [2018-12-09 00:42:45,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:45,842 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2018-12-09 00:42:45,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-09 00:42:45,843 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2018-12-09 00:42:45,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:45,843 INFO L225 Difference]: With dead ends: 50 [2018-12-09 00:42:45,843 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 00:42:45,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=275, Invalid=1531, Unknown=0, NotChecked=0, Total=1806 [2018-12-09 00:42:45,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 00:42:45,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 00:42:45,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 00:42:45,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 00:42:45,845 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2018-12-09 00:42:45,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:45,845 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 00:42:45,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-09 00:42:45,845 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 00:42:45,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 00:42:45,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 12:42:45 BoogieIcfgContainer [2018-12-09 00:42:45,849 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 00:42:45,850 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 00:42:45,850 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 00:42:45,850 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 00:42:45,850 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:42:40" (3/4) ... [2018-12-09 00:42:45,854 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 00:42:45,859 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrncpy [2018-12-09 00:42:45,860 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 00:42:45,860 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-12-09 00:42:45,860 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-12-09 00:42:45,860 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 00:42:45,865 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2018-12-09 00:42:45,865 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-12-09 00:42:45,865 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-09 00:42:45,900 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3eefb476-cbdb-4690-a5a6-4e3d33423b3d/bin-2019/uautomizer/witness.graphml [2018-12-09 00:42:45,900 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 00:42:45,901 INFO L168 Benchmark]: Toolchain (without parser) took 5829.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 184.0 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -183.6 MB). Peak memory consumption was 383.0 kB. Max. memory is 11.5 GB. [2018-12-09 00:42:45,902 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:42:45,902 INFO L168 Benchmark]: CACSL2BoogieTranslator took 256.19 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -151.5 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-12-09 00:42:45,902 INFO L168 Benchmark]: Boogie Preprocessor took 28.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 00:42:45,903 INFO L168 Benchmark]: RCFGBuilder took 224.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. [2018-12-09 00:42:45,903 INFO L168 Benchmark]: TraceAbstraction took 5266.31 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 71.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -78.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:42:45,903 INFO L168 Benchmark]: Witness Printer took 50.33 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: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2018-12-09 00:42:45,905 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 256.19 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -151.5 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 224.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5266.31 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 71.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -78.7 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 50.33 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: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 552]: 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: 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: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 558]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 43 locations, 9 error locations. SAFE Result, 5.2s OverallTime, 17 OverallIterations, 3 TraceHistogramMax, 2.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 430 SDtfs, 547 SDslu, 1849 SDs, 0 SdLazy, 1516 SolverSat, 167 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 269 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=13, 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, 17 MinimizatonAttempts, 99 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 375 NumberOfCodeBlocks, 375 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 354 ConstructedInterpolants, 12 QuantifiedInterpolants, 48716 SizeOfPredicates, 57 NumberOfNonLiveVariables, 631 ConjunctsInSsa, 173 ConjunctsInUnsatCore, 21 InterpolantComputations, 13 PerfectInterpolantSequences, 5/37 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...