./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/array-memsafety/cstrcpy-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/array-memsafety/cstrcpy-alloca_true-valid-memsafety_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 109b8bf9931c925f911ad0fbf9e2b946a30b466d .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 22:43:18,399 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 22:43:18,401 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 22:43:18,421 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 22:43:18,422 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 22:43:18,424 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 22:43:18,426 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 22:43:18,429 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 22:43:18,431 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 22:43:18,435 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 22:43:18,437 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 22:43:18,438 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 22:43:18,440 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 22:43:18,441 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 22:43:18,444 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 22:43:18,450 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 22:43:18,455 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 22:43:18,458 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 22:43:18,462 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 22:43:18,466 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 22:43:18,467 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 22:43:18,468 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 22:43:18,470 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 22:43:18,471 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 22:43:18,471 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 22:43:18,472 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 22:43:18,473 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 22:43:18,474 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 22:43:18,475 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 22:43:18,477 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 22:43:18,477 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 22:43:18,477 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 22:43:18,478 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 22:43:18,478 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 22:43:18,479 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 22:43:18,480 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 22:43:18,480 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-28 22:43:18,495 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 22:43:18,495 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 22:43:18,496 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 22:43:18,496 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 22:43:18,496 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 22:43:18,497 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 22:43:18,497 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 22:43:18,497 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 22:43:18,497 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 22:43:18,497 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 22:43:18,497 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 22:43:18,499 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 22:43:18,499 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 22:43:18,499 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 22:43:18,499 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 22:43:18,500 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-28 22:43:18,500 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 22:43:18,500 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 22:43:18,501 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 22:43:18,501 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 22:43:18,501 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 22:43:18,501 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 22:43:18,501 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 22:43:18,501 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 22:43:18,502 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 22:43:18,502 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 22:43:18,502 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 22:43:18,502 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 22:43:18,502 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 109b8bf9931c925f911ad0fbf9e2b946a30b466d [2018-11-28 22:43:18,545 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 22:43:18,562 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 22:43:18,569 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 22:43:18,571 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 22:43:18,571 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 22:43:18,572 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-11-28 22:43:18,627 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c6e508f3/6eb9eb386f51444bbc7c7d166a12edb2/FLAG7be9553bc [2018-11-28 22:43:19,094 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 22:43:19,095 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-11-28 22:43:19,116 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c6e508f3/6eb9eb386f51444bbc7c7d166a12edb2/FLAG7be9553bc [2018-11-28 22:43:19,402 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c6e508f3/6eb9eb386f51444bbc7c7d166a12edb2 [2018-11-28 22:43:19,406 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 22:43:19,408 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 22:43:19,409 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 22:43:19,410 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 22:43:19,414 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 22:43:19,415 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:43:19" (1/1) ... [2018-11-28 22:43:19,419 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a563ec6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:19, skipping insertion in model container [2018-11-28 22:43:19,419 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:43:19" (1/1) ... [2018-11-28 22:43:19,428 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 22:43:19,480 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 22:43:19,882 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 22:43:19,904 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 22:43:19,949 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 22:43:20,016 INFO L195 MainTranslator]: Completed translation [2018-11-28 22:43:20,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:20 WrapperNode [2018-11-28 22:43:20,016 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 22:43:20,018 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 22:43:20,018 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 22:43:20,018 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 22:43:20,106 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:20" (1/1) ... [2018-11-28 22:43:20,106 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:20" (1/1) ... [2018-11-28 22:43:20,134 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:20" (1/1) ... [2018-11-28 22:43:20,135 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:20" (1/1) ... [2018-11-28 22:43:20,161 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:20" (1/1) ... [2018-11-28 22:43:20,167 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:20" (1/1) ... [2018-11-28 22:43:20,170 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:20" (1/1) ... [2018-11-28 22:43:20,176 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 22:43:20,177 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 22:43:20,177 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 22:43:20,177 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 22:43:20,178 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 22:43:20,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 22:43:20,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 22:43:20,252 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-28 22:43:20,252 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-28 22:43:20,252 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrcpy [2018-11-28 22:43:20,253 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 22:43:20,253 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-28 22:43:20,253 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-28 22:43:20,253 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-28 22:43:20,253 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-28 22:43:20,254 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-28 22:43:20,254 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-28 22:43:20,254 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-28 22:43:20,254 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-28 22:43:20,254 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-28 22:43:20,254 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-28 22:43:20,254 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-28 22:43:20,254 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-28 22:43:20,255 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-28 22:43:20,255 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-28 22:43:20,255 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-28 22:43:20,255 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-28 22:43:20,255 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-28 22:43:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-28 22:43:20,261 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-28 22:43:20,261 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-28 22:43:20,261 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-28 22:43:20,261 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-28 22:43:20,261 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-28 22:43:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-28 22:43:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-28 22:43:20,263 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-28 22:43:20,263 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-28 22:43:20,263 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-28 22:43:20,264 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-28 22:43:20,264 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-28 22:43:20,265 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-28 22:43:20,265 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-28 22:43:20,265 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-28 22:43:20,265 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-28 22:43:20,265 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-28 22:43:20,265 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-28 22:43:20,266 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-28 22:43:20,266 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-28 22:43:20,266 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-28 22:43:20,266 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-28 22:43:20,266 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-28 22:43:20,266 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-28 22:43:20,267 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-28 22:43:20,268 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-28 22:43:20,268 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-28 22:43:20,268 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-28 22:43:20,268 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-28 22:43:20,269 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-28 22:43:20,269 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-28 22:43:20,269 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-28 22:43:20,269 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-28 22:43:20,269 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-28 22:43:20,269 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-28 22:43:20,269 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-28 22:43:20,270 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-28 22:43:20,270 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-28 22:43:20,271 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-28 22:43:20,271 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-28 22:43:20,272 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-28 22:43:20,272 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-28 22:43:20,272 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-28 22:43:20,272 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-28 22:43:20,272 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-28 22:43:20,272 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-28 22:43:20,272 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-28 22:43:20,273 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-28 22:43:20,274 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-28 22:43:20,274 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-28 22:43:20,274 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-28 22:43:20,274 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-28 22:43:20,274 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-28 22:43:20,274 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-28 22:43:20,274 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-28 22:43:20,275 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-28 22:43:20,275 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-28 22:43:20,275 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-28 22:43:20,275 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-28 22:43:20,275 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-28 22:43:20,275 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-28 22:43:20,275 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-28 22:43:20,276 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-28 22:43:20,277 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-28 22:43:20,277 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-28 22:43:20,278 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-28 22:43:20,278 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-28 22:43:20,278 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-28 22:43:20,278 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-28 22:43:20,278 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-28 22:43:20,278 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-28 22:43:20,278 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-28 22:43:20,279 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-28 22:43:20,281 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-28 22:43:20,281 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-28 22:43:20,281 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-28 22:43:20,281 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-28 22:43:20,281 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-28 22:43:20,281 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-28 22:43:20,281 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-28 22:43:20,282 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-28 22:43:20,283 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-28 22:43:20,283 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-28 22:43:20,283 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-28 22:43:20,283 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-28 22:43:20,283 INFO L130 BoogieDeclarations]: Found specification of procedure cstrcpy [2018-11-28 22:43:20,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 22:43:20,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 22:43:20,284 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 22:43:20,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 22:43:20,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 22:43:20,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 22:43:20,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 22:43:21,009 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 22:43:21,009 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-28 22:43:21,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:43:21 BoogieIcfgContainer [2018-11-28 22:43:21,010 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 22:43:21,011 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 22:43:21,011 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 22:43:21,015 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 22:43:21,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 10:43:19" (1/3) ... [2018-11-28 22:43:21,017 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34780f35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:43:21, skipping insertion in model container [2018-11-28 22:43:21,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:20" (2/3) ... [2018-11-28 22:43:21,017 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34780f35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:43:21, skipping insertion in model container [2018-11-28 22:43:21,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:43:21" (3/3) ... [2018-11-28 22:43:21,020 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-11-28 22:43:21,033 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 22:43:21,043 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-11-28 22:43:21,063 INFO L257 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2018-11-28 22:43:21,093 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 22:43:21,094 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 22:43:21,094 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 22:43:21,094 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 22:43:21,095 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 22:43:21,095 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 22:43:21,096 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 22:43:21,096 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 22:43:21,096 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 22:43:21,114 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-28 22:43:21,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 22:43:21,125 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:21,126 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:21,130 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-11-28 22:43:21,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:21,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1727668302, now seen corresponding path program 1 times [2018-11-28 22:43:21,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:21,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:21,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:21,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:21,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:21,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:21,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:21,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:21,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 22:43:21,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 22:43:21,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 22:43:21,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 22:43:21,355 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 4 states. [2018-11-28 22:43:21,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:21,494 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-28 22:43:21,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 22:43:21,496 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-11-28 22:43:21,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:21,507 INFO L225 Difference]: With dead ends: 35 [2018-11-28 22:43:21,508 INFO L226 Difference]: Without dead ends: 31 [2018-11-28 22:43:21,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 22:43:21,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-28 22:43:21,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-11-28 22:43:21,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-28 22:43:21,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-11-28 22:43:21,552 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 10 [2018-11-28 22:43:21,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:21,553 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-11-28 22:43:21,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 22:43:21,553 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-28 22:43:21,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 22:43:21,554 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:21,555 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:21,555 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-11-28 22:43:21,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:21,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1727668328, now seen corresponding path program 1 times [2018-11-28 22:43:21,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:21,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:21,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:21,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:21,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:21,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:21,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:21,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:21,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 22:43:21,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 22:43:21,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 22:43:21,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:43:21,654 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 3 states. [2018-11-28 22:43:21,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:21,809 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-11-28 22:43:21,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 22:43:21,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-28 22:43:21,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:21,812 INFO L225 Difference]: With dead ends: 28 [2018-11-28 22:43:21,812 INFO L226 Difference]: Without dead ends: 28 [2018-11-28 22:43:21,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:43:21,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-28 22:43:21,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-28 22:43:21,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-28 22:43:21,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-11-28 22:43:21,819 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 10 [2018-11-28 22:43:21,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:21,820 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-11-28 22:43:21,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 22:43:21,820 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-28 22:43:21,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 22:43:21,821 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:21,822 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:21,822 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-11-28 22:43:21,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:21,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1727668329, now seen corresponding path program 1 times [2018-11-28 22:43:21,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:21,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:21,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:21,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:21,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:21,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:22,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:22,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:22,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 22:43:22,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 22:43:22,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 22:43:22,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 22:43:22,026 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 4 states. [2018-11-28 22:43:22,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:22,119 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-11-28 22:43:22,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 22:43:22,120 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-11-28 22:43:22,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:22,121 INFO L225 Difference]: With dead ends: 29 [2018-11-28 22:43:22,121 INFO L226 Difference]: Without dead ends: 29 [2018-11-28 22:43:22,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 22:43:22,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-28 22:43:22,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-11-28 22:43:22,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-28 22:43:22,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-11-28 22:43:22,128 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 10 [2018-11-28 22:43:22,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:22,129 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-11-28 22:43:22,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 22:43:22,129 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-28 22:43:22,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 22:43:22,130 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:22,130 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:22,130 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-11-28 22:43:22,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:22,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1727670224, now seen corresponding path program 1 times [2018-11-28 22:43:22,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:22,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:22,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:22,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:22,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:22,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:22,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:22,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:22,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 22:43:22,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 22:43:22,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 22:43:22,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:43:22,215 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 3 states. [2018-11-28 22:43:22,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:22,373 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2018-11-28 22:43:22,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 22:43:22,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-28 22:43:22,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:22,375 INFO L225 Difference]: With dead ends: 28 [2018-11-28 22:43:22,375 INFO L226 Difference]: Without dead ends: 27 [2018-11-28 22:43:22,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:43:22,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-28 22:43:22,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-11-28 22:43:22,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-28 22:43:22,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-11-28 22:43:22,381 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 10 [2018-11-28 22:43:22,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:22,382 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-28 22:43:22,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 22:43:22,383 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-28 22:43:22,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 22:43:22,383 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:22,384 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:22,385 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-11-28 22:43:22,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:22,385 INFO L82 PathProgramCache]: Analyzing trace with hash 581866994, now seen corresponding path program 1 times [2018-11-28 22:43:22,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:22,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:22,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:22,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:22,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:22,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:22,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:22,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:22,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 22:43:22,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 22:43:22,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 22:43:22,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 22:43:22,520 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 6 states. [2018-11-28 22:43:22,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:22,698 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-11-28 22:43:22,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 22:43:22,700 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-28 22:43:22,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:22,701 INFO L225 Difference]: With dead ends: 25 [2018-11-28 22:43:22,701 INFO L226 Difference]: Without dead ends: 25 [2018-11-28 22:43:22,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 22:43:22,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-28 22:43:22,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-28 22:43:22,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-28 22:43:22,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-11-28 22:43:22,709 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 14 [2018-11-28 22:43:22,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:22,713 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-11-28 22:43:22,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 22:43:22,714 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-28 22:43:22,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 22:43:22,714 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:22,715 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:22,716 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-11-28 22:43:22,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:22,716 INFO L82 PathProgramCache]: Analyzing trace with hash 581866995, now seen corresponding path program 1 times [2018-11-28 22:43:22,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:22,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:22,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:22,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:22,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:22,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:23,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:23,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:23,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 22:43:23,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 22:43:23,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 22:43:23,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-28 22:43:23,082 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 8 states. [2018-11-28 22:43:23,399 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-28 22:43:23,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:23,520 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-11-28 22:43:23,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 22:43:23,521 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-11-28 22:43:23,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:23,522 INFO L225 Difference]: With dead ends: 31 [2018-11-28 22:43:23,522 INFO L226 Difference]: Without dead ends: 31 [2018-11-28 22:43:23,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-28 22:43:23,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-28 22:43:23,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2018-11-28 22:43:23,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-28 22:43:23,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-11-28 22:43:23,527 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 14 [2018-11-28 22:43:23,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:23,527 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-11-28 22:43:23,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 22:43:23,527 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-28 22:43:23,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-28 22:43:23,532 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:23,532 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:23,532 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-11-28 22:43:23,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:23,533 INFO L82 PathProgramCache]: Analyzing trace with hash 858007609, now seen corresponding path program 1 times [2018-11-28 22:43:23,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:23,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:23,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:23,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:23,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:23,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:23,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:23,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:23,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 22:43:23,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 22:43:23,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 22:43:23,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 22:43:23,722 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 7 states. [2018-11-28 22:43:23,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:23,836 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2018-11-28 22:43:23,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 22:43:23,837 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-11-28 22:43:23,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:23,838 INFO L225 Difference]: With dead ends: 26 [2018-11-28 22:43:23,839 INFO L226 Difference]: Without dead ends: 26 [2018-11-28 22:43:23,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-11-28 22:43:23,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-28 22:43:23,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-28 22:43:23,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-28 22:43:23,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-11-28 22:43:23,843 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 15 [2018-11-28 22:43:23,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:23,843 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-28 22:43:23,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 22:43:23,844 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-28 22:43:23,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-28 22:43:23,844 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:23,844 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:23,845 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-11-28 22:43:23,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:23,845 INFO L82 PathProgramCache]: Analyzing trace with hash 858007610, now seen corresponding path program 1 times [2018-11-28 22:43:23,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:23,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:23,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:23,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:23,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:23,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:23,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:23,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:23,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 22:43:23,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 22:43:23,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 22:43:23,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 22:43:23,971 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 7 states. [2018-11-28 22:43:24,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:24,137 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-11-28 22:43:24,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 22:43:24,140 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-11-28 22:43:24,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:24,141 INFO L225 Difference]: With dead ends: 28 [2018-11-28 22:43:24,141 INFO L226 Difference]: Without dead ends: 28 [2018-11-28 22:43:24,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-28 22:43:24,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-28 22:43:24,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-11-28 22:43:24,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-28 22:43:24,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-11-28 22:43:24,146 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 15 [2018-11-28 22:43:24,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:24,146 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-11-28 22:43:24,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 22:43:24,147 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-28 22:43:24,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 22:43:24,147 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:24,148 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:24,148 INFO L423 AbstractCegarLoop]: === Iteration 9 === [cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-11-28 22:43:24,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:24,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1554286971, now seen corresponding path program 1 times [2018-11-28 22:43:24,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:24,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:24,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:24,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:24,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:24,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:24,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:24,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:24,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 22:43:24,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 22:43:24,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 22:43:24,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-28 22:43:24,388 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 9 states. [2018-11-28 22:43:24,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:24,544 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-11-28 22:43:24,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 22:43:24,546 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-11-28 22:43:24,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:24,548 INFO L225 Difference]: With dead ends: 41 [2018-11-28 22:43:24,548 INFO L226 Difference]: Without dead ends: 41 [2018-11-28 22:43:24,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-11-28 22:43:24,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-28 22:43:24,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2018-11-28 22:43:24,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-28 22:43:24,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-11-28 22:43:24,554 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 18 [2018-11-28 22:43:24,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:24,559 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-11-28 22:43:24,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 22:43:24,560 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-11-28 22:43:24,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 22:43:24,560 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:24,561 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:24,561 INFO L423 AbstractCegarLoop]: === Iteration 10 === [cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-11-28 22:43:24,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:24,561 INFO L82 PathProgramCache]: Analyzing trace with hash -2039615747, now seen corresponding path program 1 times [2018-11-28 22:43:24,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:24,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:24,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:24,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:24,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:24,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:24,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:24,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:24,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 22:43:24,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 22:43:24,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 22:43:24,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-11-28 22:43:24,802 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 10 states. [2018-11-28 22:43:25,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:25,034 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2018-11-28 22:43:25,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 22:43:25,035 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-11-28 22:43:25,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:25,039 INFO L225 Difference]: With dead ends: 64 [2018-11-28 22:43:25,040 INFO L226 Difference]: Without dead ends: 64 [2018-11-28 22:43:25,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-11-28 22:43:25,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-28 22:43:25,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 39. [2018-11-28 22:43:25,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-28 22:43:25,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-11-28 22:43:25,045 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 18 [2018-11-28 22:43:25,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:25,046 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-11-28 22:43:25,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 22:43:25,046 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-11-28 22:43:25,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 22:43:25,047 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:25,047 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:25,047 INFO L423 AbstractCegarLoop]: === Iteration 11 === [cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-11-28 22:43:25,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:25,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1781450309, now seen corresponding path program 1 times [2018-11-28 22:43:25,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:25,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:25,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:25,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:25,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:25,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:25,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:25,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:43:25,329 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 22:43:25,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:25,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:25,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:43:25,488 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-11-28 22:43:25,503 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-11-28 22:43:25,504 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:43:25,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:43:25,603 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-11-28 22:43:25,604 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-11-28 22:43:25,929 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-11-28 22:43:25,949 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-11-28 22:43:25,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 22:43:25,961 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:43:26,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:43:26,077 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-11-28 22:43:26,160 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:26,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:43:26,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2018-11-28 22:43:26,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-28 22:43:26,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-28 22:43:26,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-11-28 22:43:26,185 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 16 states. [2018-11-28 22:43:27,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:27,118 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2018-11-28 22:43:27,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 22:43:27,119 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-11-28 22:43:27,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:27,120 INFO L225 Difference]: With dead ends: 45 [2018-11-28 22:43:27,120 INFO L226 Difference]: Without dead ends: 45 [2018-11-28 22:43:27,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2018-11-28 22:43:27,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-28 22:43:27,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-11-28 22:43:27,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-28 22:43:27,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-11-28 22:43:27,134 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 18 [2018-11-28 22:43:27,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:27,134 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-11-28 22:43:27,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-28 22:43:27,134 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-28 22:43:27,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-28 22:43:27,135 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:27,135 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:27,135 INFO L423 AbstractCegarLoop]: === Iteration 12 === [cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-11-28 22:43:27,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:27,136 INFO L82 PathProgramCache]: Analyzing trace with hash 609615218, now seen corresponding path program 1 times [2018-11-28 22:43:27,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:27,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:27,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:27,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:27,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:27,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:27,345 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-28 22:43:28,205 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:28,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:43:28,206 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 22:43:28,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:28,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:28,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:43:28,412 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-28 22:43:28,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 22:43:28,431 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:43:28,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-28 22:43:28,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-11-28 22:43:28,512 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 22:43:28,519 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:43:28,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:43:28,543 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:25, output treesize:15 [2018-11-28 22:43:28,778 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:28,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:43:28,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2018-11-28 22:43:28,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-28 22:43:28,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-28 22:43:28,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2018-11-28 22:43:28,799 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 19 states. [2018-11-28 22:43:29,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:29,820 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-11-28 22:43:29,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 22:43:29,822 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2018-11-28 22:43:29,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:29,823 INFO L225 Difference]: With dead ends: 46 [2018-11-28 22:43:29,823 INFO L226 Difference]: Without dead ends: 46 [2018-11-28 22:43:29,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2018-11-28 22:43:29,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-28 22:43:29,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2018-11-28 22:43:29,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-28 22:43:29,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-11-28 22:43:29,836 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 19 [2018-11-28 22:43:29,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:29,836 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-11-28 22:43:29,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-28 22:43:29,836 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-28 22:43:29,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 22:43:29,837 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:29,837 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] [2018-11-28 22:43:29,837 INFO L423 AbstractCegarLoop]: === Iteration 13 === [cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-11-28 22:43:29,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:29,839 INFO L82 PathProgramCache]: Analyzing trace with hash -322227997, now seen corresponding path program 1 times [2018-11-28 22:43:29,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:29,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:29,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:29,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:29,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:29,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:29,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:29,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:29,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 22:43:29,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 22:43:29,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 22:43:29,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 22:43:29,970 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 4 states. [2018-11-28 22:43:30,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:30,011 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-28 22:43:30,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 22:43:30,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-11-28 22:43:30,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:30,014 INFO L225 Difference]: With dead ends: 40 [2018-11-28 22:43:30,014 INFO L226 Difference]: Without dead ends: 23 [2018-11-28 22:43:30,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 22:43:30,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-28 22:43:30,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-28 22:43:30,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-28 22:43:30,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-11-28 22:43:30,017 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-11-28 22:43:30,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:30,017 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-11-28 22:43:30,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 22:43:30,017 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-28 22:43:30,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 22:43:30,018 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:30,018 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:30,018 INFO L423 AbstractCegarLoop]: === Iteration 14 === [cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-11-28 22:43:30,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:30,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1925187907, now seen corresponding path program 2 times [2018-11-28 22:43:30,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:30,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:30,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:30,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:30,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:30,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:30,515 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:30,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:43:30,515 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 22:43:30,525 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 22:43:30,561 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 22:43:30,561 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 22:43:30,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:43:30,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 22:43:30,617 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:43:30,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:43:30,622 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-11-28 22:43:30,660 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 14 treesize of output 11 [2018-11-28 22:43:30,664 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-11-28 22:43:30,664 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:43:30,686 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:43:30,717 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-11-28 22:43:30,717 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-11-28 22:43:31,023 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 31 treesize of output 32 [2018-11-28 22:43:31,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 22:43:31,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:43:31,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:43:31,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-28 22:43:31,134 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:53, output treesize:49 [2018-11-28 22:43:31,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-11-28 22:43:31,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-11-28 22:43:31,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:43:31,427 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:43:31,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 35 [2018-11-28 22:43:31,482 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 22:43:31,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:43:31,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:43:31,530 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:65, output treesize:43 [2018-11-28 22:43:31,657 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:31,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:43:31,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 23 [2018-11-28 22:43:31,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-28 22:43:31,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-28 22:43:31,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=500, Unknown=0, NotChecked=0, Total=552 [2018-11-28 22:43:31,678 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 24 states. [2018-11-28 22:43:32,261 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2018-11-28 22:43:32,451 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2018-11-28 22:43:33,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:33,273 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-28 22:43:33,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-28 22:43:33,280 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 22 [2018-11-28 22:43:33,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:33,281 INFO L225 Difference]: With dead ends: 29 [2018-11-28 22:43:33,281 INFO L226 Difference]: Without dead ends: 29 [2018-11-28 22:43:33,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=126, Invalid=1064, Unknown=0, NotChecked=0, Total=1190 [2018-11-28 22:43:33,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-28 22:43:33,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-11-28 22:43:33,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-28 22:43:33,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-11-28 22:43:33,285 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 22 [2018-11-28 22:43:33,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:33,285 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-11-28 22:43:33,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-28 22:43:33,286 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-28 22:43:33,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 22:43:33,286 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:33,286 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:33,287 INFO L423 AbstractCegarLoop]: === Iteration 15 === [cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-11-28 22:43:33,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:33,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1792289589, now seen corresponding path program 3 times [2018-11-28 22:43:33,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:33,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:33,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:33,289 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 22:43:33,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:33,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:33,504 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-28 22:43:33,705 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 22:43:33,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:43:33,705 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 22:43:33,715 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 22:43:33,749 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-28 22:43:33,749 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 22:43:33,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:43:33,858 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-28 22:43:33,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 22:43:33,871 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:43:33,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-28 22:43:33,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-11-28 22:43:33,886 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 22:43:33,890 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:43:33,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:43:33,898 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2018-11-28 22:43:33,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-28 22:43:33,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-28 22:43:33,910 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:43:33,912 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:43:33,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:43:33,919 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-11-28 22:43:33,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-11-28 22:43:33,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 22:43:33,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:43:33,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:43:33,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:43:33,993 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-11-28 22:43:34,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-11-28 22:43:34,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 22:43:34,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:43:34,071 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:43:34,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:43:34,077 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2018-11-28 22:43:34,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-28 22:43:34,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-11-28 22:43:34,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 22:43:34,139 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:43:34,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:43:34,150 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-11-28 22:43:34,198 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 22:43:34,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:43:34,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 18 [2018-11-28 22:43:34,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-28 22:43:34,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-28 22:43:34,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2018-11-28 22:43:34,219 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 19 states. [2018-11-28 22:43:34,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:34,708 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-28 22:43:34,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 22:43:34,709 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 26 [2018-11-28 22:43:34,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:34,710 INFO L225 Difference]: With dead ends: 26 [2018-11-28 22:43:34,710 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 22:43:34,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 16 SyntacticMatches, 7 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2018-11-28 22:43:34,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 22:43:34,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 22:43:34,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 22:43:34,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 22:43:34,712 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2018-11-28 22:43:34,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:34,712 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 22:43:34,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-28 22:43:34,713 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 22:43:34,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 22:43:34,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 10:43:34 BoogieIcfgContainer [2018-11-28 22:43:34,718 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 22:43:34,719 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 22:43:34,719 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 22:43:34,719 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 22:43:34,719 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:43:21" (3/4) ... [2018-11-28 22:43:34,723 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 22:43:34,731 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrcpy [2018-11-28 22:43:34,731 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 22:43:34,731 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-11-28 22:43:34,732 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-11-28 22:43:34,732 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 22:43:34,736 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2018-11-28 22:43:34,737 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-28 22:43:34,737 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-28 22:43:34,786 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 22:43:34,786 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 22:43:34,787 INFO L168 Benchmark]: Toolchain (without parser) took 15380.12 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 273.7 MB). Free memory was 951.3 MB in the beginning and 956.0 MB in the end (delta: -4.7 MB). Peak memory consumption was 269.0 MB. Max. memory is 11.5 GB. [2018-11-28 22:43:34,788 INFO L168 Benchmark]: CDTParser took 1.40 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 22:43:34,788 INFO L168 Benchmark]: CACSL2BoogieTranslator took 607.83 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 929.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-28 22:43:34,789 INFO L168 Benchmark]: Boogie Preprocessor took 158.55 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -151.1 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. [2018-11-28 22:43:34,790 INFO L168 Benchmark]: RCFGBuilder took 833.72 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 40.0 MB). Peak memory consumption was 40.0 MB. Max. memory is 11.5 GB. [2018-11-28 22:43:34,790 INFO L168 Benchmark]: TraceAbstraction took 13707.01 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 180.4 MB). Free memory was 1.0 GB in the beginning and 956.0 MB in the end (delta: 84.9 MB). Peak memory consumption was 265.2 MB. Max. memory is 11.5 GB. [2018-11-28 22:43:34,791 INFO L168 Benchmark]: Witness Printer took 67.43 ms. Allocated memory is still 1.3 GB. Free memory was 956.0 MB in the beginning and 956.0 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2018-11-28 22:43:34,795 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.40 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 607.83 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 929.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 158.55 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -151.1 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 833.72 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 40.0 MB). Peak memory consumption was 40.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13707.01 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 180.4 MB). Free memory was 1.0 GB in the beginning and 956.0 MB in the end (delta: 84.9 MB). Peak memory consumption was 265.2 MB. Max. memory is 11.5 GB. * Witness Printer took 67.43 ms. Allocated memory is still 1.3 GB. Free memory was 956.0 MB in the beginning and 956.0 MB 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: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 560]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 560]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 7 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 37 locations, 7 error locations. SAFE Result, 13.6s OverallTime, 15 OverallIterations, 4 TraceHistogramMax, 6.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 296 SDtfs, 282 SDslu, 1238 SDs, 0 SdLazy, 1151 SolverSat, 92 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 240 GetRequests, 66 SyntacticMatches, 7 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 7.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=11, 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.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 48 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 325 NumberOfCodeBlocks, 325 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 306 ConstructedInterpolants, 13 QuantifiedInterpolants, 51634 SizeOfPredicates, 65 NumberOfNonLiveVariables, 626 ConjunctsInSsa, 192 ConjunctsInUnsatCore, 19 InterpolantComputations, 11 PerfectInterpolantSequences, 6/66 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...