./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 0ed9222f 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-0ed9222-m [2019-01-14 18:07:29,782 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 18:07:29,784 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 18:07:29,796 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 18:07:29,796 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 18:07:29,797 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 18:07:29,798 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 18:07:29,800 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 18:07:29,802 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 18:07:29,803 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 18:07:29,804 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 18:07:29,805 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 18:07:29,806 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 18:07:29,807 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 18:07:29,808 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 18:07:29,809 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 18:07:29,810 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 18:07:29,812 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 18:07:29,814 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 18:07:29,816 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 18:07:29,817 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 18:07:29,818 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 18:07:29,821 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 18:07:29,821 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 18:07:29,821 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 18:07:29,823 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 18:07:29,824 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 18:07:29,825 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 18:07:29,825 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 18:07:29,827 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 18:07:29,827 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 18:07:29,828 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 18:07:29,828 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 18:07:29,828 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 18:07:29,829 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 18:07:29,831 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 18:07:29,831 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-14 18:07:29,846 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 18:07:29,846 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 18:07:29,847 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 18:07:29,847 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 18:07:29,848 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 18:07:29,848 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 18:07:29,849 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 18:07:29,849 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 18:07:29,849 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 18:07:29,849 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 18:07:29,849 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 18:07:29,849 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-14 18:07:29,850 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-14 18:07:29,850 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-14 18:07:29,850 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 18:07:29,850 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 18:07:29,850 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 18:07:29,850 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 18:07:29,851 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 18:07:29,852 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 18:07:29,853 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 18:07:29,853 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 18:07:29,853 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 18:07:29,853 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 18:07:29,853 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 18:07:29,853 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 [2019-01-14 18:07:29,890 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 18:07:29,908 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 18:07:29,914 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 18:07:29,916 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 18:07:29,916 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 18:07:29,918 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/cstrcpy-alloca_true-valid-memsafety_true-termination.i [2019-01-14 18:07:29,980 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b1941637/9a8638349e4f4364829e47a52a44559c/FLAG02e2289fc [2019-01-14 18:07:30,419 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 18:07:30,419 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/cstrcpy-alloca_true-valid-memsafety_true-termination.i [2019-01-14 18:07:30,444 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b1941637/9a8638349e4f4364829e47a52a44559c/FLAG02e2289fc [2019-01-14 18:07:30,768 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b1941637/9a8638349e4f4364829e47a52a44559c [2019-01-14 18:07:30,773 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 18:07:30,775 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-14 18:07:30,776 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 18:07:30,776 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 18:07:30,780 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 18:07:30,781 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 06:07:30" (1/1) ... [2019-01-14 18:07:30,785 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2515722b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:07:30, skipping insertion in model container [2019-01-14 18:07:30,785 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 06:07:30" (1/1) ... [2019-01-14 18:07:30,794 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 18:07:30,840 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 18:07:31,188 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 18:07:31,210 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 18:07:31,331 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 18:07:31,388 INFO L195 MainTranslator]: Completed translation [2019-01-14 18:07:31,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:07:31 WrapperNode [2019-01-14 18:07:31,389 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 18:07:31,390 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 18:07:31,390 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 18:07:31,390 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 18:07:31,405 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:07:31" (1/1) ... [2019-01-14 18:07:31,406 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:07:31" (1/1) ... [2019-01-14 18:07:31,422 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:07:31" (1/1) ... [2019-01-14 18:07:31,423 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:07:31" (1/1) ... [2019-01-14 18:07:31,438 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:07:31" (1/1) ... [2019-01-14 18:07:31,446 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:07:31" (1/1) ... [2019-01-14 18:07:31,449 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:07:31" (1/1) ... [2019-01-14 18:07:31,455 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 18:07:31,456 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 18:07:31,456 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 18:07:31,456 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 18:07:31,457 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:07:31" (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 [2019-01-14 18:07:31,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-14 18:07:31,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 18:07:31,519 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-14 18:07:31,519 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-14 18:07:31,519 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrcpy [2019-01-14 18:07:31,519 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-14 18:07:31,519 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-14 18:07:31,520 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-14 18:07:31,520 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-14 18:07:31,520 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-14 18:07:31,520 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-14 18:07:31,520 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-14 18:07:31,521 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-14 18:07:31,521 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-14 18:07:31,521 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-14 18:07:31,521 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-14 18:07:31,521 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-14 18:07:31,521 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-14 18:07:31,522 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-14 18:07:31,522 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-14 18:07:31,522 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-14 18:07:31,522 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-14 18:07:31,522 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-14 18:07:31,522 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-14 18:07:31,523 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-14 18:07:31,523 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-14 18:07:31,523 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-14 18:07:31,523 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-14 18:07:31,523 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-14 18:07:31,523 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-14 18:07:31,524 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-14 18:07:31,524 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-14 18:07:31,524 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-14 18:07:31,524 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-14 18:07:31,524 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-14 18:07:31,524 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-14 18:07:31,524 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-14 18:07:31,525 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-14 18:07:31,525 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-14 18:07:31,525 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-14 18:07:31,525 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-14 18:07:31,525 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-14 18:07:31,525 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-14 18:07:31,526 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-14 18:07:31,526 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-14 18:07:31,526 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-14 18:07:31,526 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-14 18:07:31,526 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-14 18:07:31,526 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-14 18:07:31,527 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-14 18:07:31,527 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-14 18:07:31,527 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-14 18:07:31,527 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-14 18:07:31,527 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-14 18:07:31,527 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-14 18:07:31,528 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-14 18:07:31,528 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-14 18:07:31,528 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-14 18:07:31,528 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-14 18:07:31,528 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-14 18:07:31,528 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-14 18:07:31,528 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-14 18:07:31,528 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-14 18:07:31,529 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-14 18:07:31,529 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-14 18:07:31,529 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-14 18:07:31,529 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-14 18:07:31,529 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-14 18:07:31,529 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-14 18:07:31,529 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-14 18:07:31,530 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-14 18:07:31,530 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-14 18:07:31,530 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-14 18:07:31,530 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-14 18:07:31,530 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-14 18:07:31,530 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-14 18:07:31,530 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-14 18:07:31,530 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-14 18:07:31,531 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-14 18:07:31,531 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-14 18:07:31,531 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-14 18:07:31,531 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-14 18:07:31,531 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-14 18:07:31,531 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-14 18:07:31,531 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-14 18:07:31,532 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-14 18:07:31,532 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-14 18:07:31,532 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-14 18:07:31,532 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-14 18:07:31,532 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-14 18:07:31,532 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-14 18:07:31,532 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-14 18:07:31,532 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-14 18:07:31,533 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-14 18:07:31,533 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-14 18:07:31,533 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-14 18:07:31,533 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-14 18:07:31,533 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-14 18:07:31,533 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-14 18:07:31,533 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-14 18:07:31,534 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-14 18:07:31,534 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-14 18:07:31,534 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-14 18:07:31,534 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-14 18:07:31,534 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-14 18:07:31,534 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-14 18:07:31,534 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-14 18:07:31,534 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-14 18:07:31,535 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-14 18:07:31,535 INFO L130 BoogieDeclarations]: Found specification of procedure cstrcpy [2019-01-14 18:07:31,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 18:07:31,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 18:07:31,535 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-14 18:07:31,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 18:07:31,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 18:07:31,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-14 18:07:31,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 18:07:32,083 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 18:07:32,083 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-01-14 18:07:32,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 06:07:32 BoogieIcfgContainer [2019-01-14 18:07:32,085 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 18:07:32,085 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 18:07:32,086 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 18:07:32,089 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 18:07:32,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 06:07:30" (1/3) ... [2019-01-14 18:07:32,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a53ced3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 06:07:32, skipping insertion in model container [2019-01-14 18:07:32,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:07:31" (2/3) ... [2019-01-14 18:07:32,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a53ced3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 06:07:32, skipping insertion in model container [2019-01-14 18:07:32,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 06:07:32" (3/3) ... [2019-01-14 18:07:32,092 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrcpy-alloca_true-valid-memsafety_true-termination.i [2019-01-14 18:07:32,102 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 18:07:32,111 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-01-14 18:07:32,127 INFO L257 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-01-14 18:07:32,154 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 18:07:32,155 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 18:07:32,155 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-14 18:07:32,155 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 18:07:32,155 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 18:07:32,155 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 18:07:32,156 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 18:07:32,156 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 18:07:32,156 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 18:07:32,172 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-01-14 18:07:32,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 18:07:32,183 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:32,184 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:32,187 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-14 18:07:32,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:32,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1727668302, now seen corresponding path program 1 times [2019-01-14 18:07:32,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:32,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:32,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:32,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:32,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:32,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:32,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:32,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:07:32,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 18:07:32,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 18:07:32,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 18:07:32,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 18:07:32,390 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 4 states. [2019-01-14 18:07:32,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:32,504 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2019-01-14 18:07:32,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 18:07:32,506 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-14 18:07:32,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:32,517 INFO L225 Difference]: With dead ends: 35 [2019-01-14 18:07:32,517 INFO L226 Difference]: Without dead ends: 31 [2019-01-14 18:07:32,519 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 [2019-01-14 18:07:32,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-14 18:07:32,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2019-01-14 18:07:32,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-14 18:07:32,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-01-14 18:07:32,560 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 10 [2019-01-14 18:07:32,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:32,560 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-01-14 18:07:32,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 18:07:32,561 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-01-14 18:07:32,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 18:07:32,562 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:32,562 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:32,562 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-14 18:07:32,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:32,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1727668328, now seen corresponding path program 1 times [2019-01-14 18:07:32,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:32,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:32,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:32,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:32,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:32,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:32,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:32,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:07:32,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 18:07:32,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 18:07:32,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 18:07:32,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 18:07:32,636 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 3 states. [2019-01-14 18:07:32,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:32,698 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2019-01-14 18:07:32,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 18:07:32,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-14 18:07:32,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:32,700 INFO L225 Difference]: With dead ends: 28 [2019-01-14 18:07:32,700 INFO L226 Difference]: Without dead ends: 28 [2019-01-14 18:07:32,701 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 [2019-01-14 18:07:32,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-14 18:07:32,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-01-14 18:07:32,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-14 18:07:32,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2019-01-14 18:07:32,705 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 10 [2019-01-14 18:07:32,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:32,706 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2019-01-14 18:07:32,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 18:07:32,706 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2019-01-14 18:07:32,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 18:07:32,707 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:32,707 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:32,707 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-14 18:07:32,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:32,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1727668329, now seen corresponding path program 1 times [2019-01-14 18:07:32,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:32,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:32,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:32,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:32,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:32,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:32,990 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 11 [2019-01-14 18:07:32,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:32,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:07:32,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 18:07:32,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 18:07:32,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 18:07:32,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 18:07:32,994 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 4 states. [2019-01-14 18:07:33,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:33,043 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2019-01-14 18:07:33,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 18:07:33,044 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-14 18:07:33,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:33,047 INFO L225 Difference]: With dead ends: 33 [2019-01-14 18:07:33,047 INFO L226 Difference]: Without dead ends: 33 [2019-01-14 18:07:33,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 18:07:33,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-14 18:07:33,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2019-01-14 18:07:33,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-14 18:07:33,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-01-14 18:07:33,058 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 10 [2019-01-14 18:07:33,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:33,058 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-01-14 18:07:33,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 18:07:33,059 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-01-14 18:07:33,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 18:07:33,059 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:33,059 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:33,060 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-14 18:07:33,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:33,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1727670224, now seen corresponding path program 1 times [2019-01-14 18:07:33,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:33,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:33,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:33,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:33,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:33,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:33,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:33,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:07:33,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 18:07:33,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 18:07:33,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 18:07:33,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 18:07:33,101 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 3 states. [2019-01-14 18:07:33,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:33,149 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-01-14 18:07:33,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 18:07:33,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-14 18:07:33,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:33,152 INFO L225 Difference]: With dead ends: 30 [2019-01-14 18:07:33,152 INFO L226 Difference]: Without dead ends: 29 [2019-01-14 18:07:33,152 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 [2019-01-14 18:07:33,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-14 18:07:33,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-14 18:07:33,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-14 18:07:33,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2019-01-14 18:07:33,157 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 10 [2019-01-14 18:07:33,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:33,157 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2019-01-14 18:07:33,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 18:07:33,158 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2019-01-14 18:07:33,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 18:07:33,158 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:33,158 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:33,159 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-14 18:07:33,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:33,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1727670251, now seen corresponding path program 1 times [2019-01-14 18:07:33,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:33,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:33,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:33,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:33,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:33,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:33,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:33,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:07:33,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 18:07:33,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 18:07:33,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 18:07:33,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 18:07:33,293 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 4 states. [2019-01-14 18:07:33,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:33,315 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2019-01-14 18:07:33,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 18:07:33,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-14 18:07:33,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:33,317 INFO L225 Difference]: With dead ends: 28 [2019-01-14 18:07:33,318 INFO L226 Difference]: Without dead ends: 28 [2019-01-14 18:07:33,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 18:07:33,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-14 18:07:33,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-01-14 18:07:33,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-14 18:07:33,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-01-14 18:07:33,324 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 10 [2019-01-14 18:07:33,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:33,325 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-01-14 18:07:33,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 18:07:33,325 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-01-14 18:07:33,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-14 18:07:33,326 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:33,326 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:33,327 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-14 18:07:33,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:33,327 INFO L82 PathProgramCache]: Analyzing trace with hash 581866994, now seen corresponding path program 1 times [2019-01-14 18:07:33,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:33,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:33,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:33,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:33,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:33,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:33,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:33,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:07:33,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 18:07:33,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 18:07:33,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 18:07:33,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 18:07:33,420 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 6 states. [2019-01-14 18:07:33,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:33,842 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2019-01-14 18:07:33,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 18:07:33,843 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-01-14 18:07:33,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:33,844 INFO L225 Difference]: With dead ends: 25 [2019-01-14 18:07:33,845 INFO L226 Difference]: Without dead ends: 25 [2019-01-14 18:07:33,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-14 18:07:33,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-14 18:07:33,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-14 18:07:33,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-14 18:07:33,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2019-01-14 18:07:33,850 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 14 [2019-01-14 18:07:33,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:33,850 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-01-14 18:07:33,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 18:07:33,850 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2019-01-14 18:07:33,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-14 18:07:33,851 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:33,851 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:33,851 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-14 18:07:33,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:33,852 INFO L82 PathProgramCache]: Analyzing trace with hash 581866995, now seen corresponding path program 1 times [2019-01-14 18:07:33,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:33,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:33,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:33,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:33,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:33,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:34,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:34,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:07:34,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 18:07:34,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 18:07:34,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 18:07:34,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-14 18:07:34,035 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 8 states. [2019-01-14 18:07:34,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:34,267 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-01-14 18:07:34,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 18:07:34,268 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-01-14 18:07:34,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:34,269 INFO L225 Difference]: With dead ends: 31 [2019-01-14 18:07:34,269 INFO L226 Difference]: Without dead ends: 31 [2019-01-14 18:07:34,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-01-14 18:07:34,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-14 18:07:34,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2019-01-14 18:07:34,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-14 18:07:34,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-01-14 18:07:34,274 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 14 [2019-01-14 18:07:34,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:34,274 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-01-14 18:07:34,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 18:07:34,275 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-01-14 18:07:34,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-14 18:07:34,277 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:34,277 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:34,278 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-14 18:07:34,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:34,279 INFO L82 PathProgramCache]: Analyzing trace with hash 858007609, now seen corresponding path program 1 times [2019-01-14 18:07:34,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:34,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:34,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:34,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:34,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:34,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:34,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:34,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:07:34,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 18:07:34,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 18:07:34,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 18:07:34,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 18:07:34,407 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 6 states. [2019-01-14 18:07:34,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:34,497 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2019-01-14 18:07:34,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 18:07:34,498 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-01-14 18:07:34,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:34,499 INFO L225 Difference]: With dead ends: 26 [2019-01-14 18:07:34,499 INFO L226 Difference]: Without dead ends: 26 [2019-01-14 18:07:34,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-14 18:07:34,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-14 18:07:34,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-14 18:07:34,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-14 18:07:34,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-01-14 18:07:34,504 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 15 [2019-01-14 18:07:34,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:34,504 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-01-14 18:07:34,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 18:07:34,505 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-01-14 18:07:34,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-14 18:07:34,505 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:34,505 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:34,506 INFO L423 AbstractCegarLoop]: === Iteration 9 === [cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-14 18:07:34,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:34,506 INFO L82 PathProgramCache]: Analyzing trace with hash 858007610, now seen corresponding path program 1 times [2019-01-14 18:07:34,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:34,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:34,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:34,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:34,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:34,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:34,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:34,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:07:34,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 18:07:34,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 18:07:34,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 18:07:34,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-14 18:07:34,676 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 7 states. [2019-01-14 18:07:34,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:34,797 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2019-01-14 18:07:34,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 18:07:34,799 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-01-14 18:07:34,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:34,800 INFO L225 Difference]: With dead ends: 28 [2019-01-14 18:07:34,800 INFO L226 Difference]: Without dead ends: 28 [2019-01-14 18:07:34,801 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 [2019-01-14 18:07:34,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-14 18:07:34,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-01-14 18:07:34,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-14 18:07:34,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-01-14 18:07:34,804 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 15 [2019-01-14 18:07:34,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:34,805 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-01-14 18:07:34,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 18:07:34,805 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-01-14 18:07:34,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-14 18:07:34,806 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:34,806 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:34,806 INFO L423 AbstractCegarLoop]: === Iteration 10 === [cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-14 18:07:34,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:34,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1554286971, now seen corresponding path program 1 times [2019-01-14 18:07:34,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:34,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:34,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:34,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:34,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:34,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:35,070 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 10 [2019-01-14 18:07:35,131 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:35,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:07:35,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-14 18:07:35,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 18:07:35,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 18:07:35,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-01-14 18:07:35,134 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 9 states. [2019-01-14 18:07:35,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:35,314 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2019-01-14 18:07:35,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 18:07:35,316 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-01-14 18:07:35,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:35,316 INFO L225 Difference]: With dead ends: 41 [2019-01-14 18:07:35,316 INFO L226 Difference]: Without dead ends: 41 [2019-01-14 18:07:35,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-01-14 18:07:35,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-14 18:07:35,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2019-01-14 18:07:35,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-14 18:07:35,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2019-01-14 18:07:35,323 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 18 [2019-01-14 18:07:35,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:35,323 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2019-01-14 18:07:35,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 18:07:35,324 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2019-01-14 18:07:35,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-14 18:07:35,324 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:35,325 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:35,325 INFO L423 AbstractCegarLoop]: === Iteration 11 === [cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-14 18:07:35,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:35,325 INFO L82 PathProgramCache]: Analyzing trace with hash -2039615747, now seen corresponding path program 1 times [2019-01-14 18:07:35,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:35,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:35,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:35,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:35,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:35,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:35,642 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:35,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:07:35,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-14 18:07:35,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 18:07:35,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 18:07:35,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-01-14 18:07:35,644 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 10 states. [2019-01-14 18:07:35,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:35,852 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2019-01-14 18:07:35,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 18:07:35,853 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-01-14 18:07:35,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:35,857 INFO L225 Difference]: With dead ends: 64 [2019-01-14 18:07:35,857 INFO L226 Difference]: Without dead ends: 64 [2019-01-14 18:07:35,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2019-01-14 18:07:35,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-14 18:07:35,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 39. [2019-01-14 18:07:35,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-14 18:07:35,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-01-14 18:07:35,865 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 18 [2019-01-14 18:07:35,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:35,865 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-01-14 18:07:35,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 18:07:35,866 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-01-14 18:07:35,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-14 18:07:35,866 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:35,866 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:35,867 INFO L423 AbstractCegarLoop]: === Iteration 12 === [cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-14 18:07:35,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:35,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1781450309, now seen corresponding path program 1 times [2019-01-14 18:07:35,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:35,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:35,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:35,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:35,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:35,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:36,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:36,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 18:07:36,150 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 [2019-01-14 18:07:36,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:36,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:36,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:07:36,276 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 [2019-01-14 18:07:36,279 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 [2019-01-14 18:07:36,279 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:07:36,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:07:36,297 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. [2019-01-14 18:07:36,297 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-01-14 18:07:36,671 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 [2019-01-14 18:07:36,696 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 [2019-01-14 18:07:36,697 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 18:07:36,703 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:07:36,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:07:36,759 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2019-01-14 18:07:36,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:36,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 18:07:36,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2019-01-14 18:07:36,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-14 18:07:36,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-14 18:07:36,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-01-14 18:07:36,836 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 16 states. [2019-01-14 18:07:37,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:37,805 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2019-01-14 18:07:37,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 18:07:37,807 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2019-01-14 18:07:37,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:37,807 INFO L225 Difference]: With dead ends: 45 [2019-01-14 18:07:37,807 INFO L226 Difference]: Without dead ends: 45 [2019-01-14 18:07:37,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2019-01-14 18:07:37,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-14 18:07:37,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2019-01-14 18:07:37,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-14 18:07:37,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-01-14 18:07:37,816 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 18 [2019-01-14 18:07:37,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:37,816 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-01-14 18:07:37,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-14 18:07:37,816 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-01-14 18:07:37,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 18:07:37,817 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:37,817 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:37,817 INFO L423 AbstractCegarLoop]: === Iteration 13 === [cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-14 18:07:37,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:37,818 INFO L82 PathProgramCache]: Analyzing trace with hash 609615218, now seen corresponding path program 1 times [2019-01-14 18:07:37,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:37,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:37,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:37,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:37,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:37,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:38,088 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-01-14 18:07:38,370 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:38,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 18:07:38,371 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 [2019-01-14 18:07:38,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:38,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:38,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:07:38,455 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 [2019-01-14 18:07:38,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:07:38,483 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 [2019-01-14 18:07:38,488 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 [2019-01-14 18:07:38,489 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 18:07:38,501 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:07:38,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:07:38,514 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:25, output treesize:15 [2019-01-14 18:07:38,784 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:38,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 18:07:38,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2019-01-14 18:07:38,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-14 18:07:38,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-14 18:07:38,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2019-01-14 18:07:38,803 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 20 states. [2019-01-14 18:07:39,610 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-01-14 18:07:39,760 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-01-14 18:07:40,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:40,065 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2019-01-14 18:07:40,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-14 18:07:40,066 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-01-14 18:07:40,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:40,067 INFO L225 Difference]: With dead ends: 47 [2019-01-14 18:07:40,067 INFO L226 Difference]: Without dead ends: 47 [2019-01-14 18:07:40,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=115, Invalid=815, Unknown=0, NotChecked=0, Total=930 [2019-01-14 18:07:40,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-14 18:07:40,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2019-01-14 18:07:40,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-14 18:07:40,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-01-14 18:07:40,076 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 19 [2019-01-14 18:07:40,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:40,076 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-01-14 18:07:40,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-14 18:07:40,076 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-01-14 18:07:40,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 18:07:40,077 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:40,077 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] [2019-01-14 18:07:40,077 INFO L423 AbstractCegarLoop]: === Iteration 14 === [cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-14 18:07:40,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:40,080 INFO L82 PathProgramCache]: Analyzing trace with hash -322227997, now seen corresponding path program 1 times [2019-01-14 18:07:40,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:40,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:40,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:40,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:40,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:40,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:40,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:40,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:07:40,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 18:07:40,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 18:07:40,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 18:07:40,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 18:07:40,287 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 4 states. [2019-01-14 18:07:40,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:40,334 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2019-01-14 18:07:40,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 18:07:40,337 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-01-14 18:07:40,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:40,338 INFO L225 Difference]: With dead ends: 42 [2019-01-14 18:07:40,338 INFO L226 Difference]: Without dead ends: 25 [2019-01-14 18:07:40,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 18:07:40,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-14 18:07:40,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-14 18:07:40,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-14 18:07:40,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-01-14 18:07:40,342 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 21 [2019-01-14 18:07:40,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:40,343 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-01-14 18:07:40,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 18:07:40,343 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-01-14 18:07:40,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-14 18:07:40,343 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:40,344 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:40,345 INFO L423 AbstractCegarLoop]: === Iteration 15 === [cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-14 18:07:40,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:40,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1925187907, now seen corresponding path program 2 times [2019-01-14 18:07:40,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:40,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:40,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:40,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:40,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:40,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:40,667 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 16 [2019-01-14 18:07:41,163 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:41,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 18:07:41,164 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 [2019-01-14 18:07:41,176 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 18:07:41,227 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 18:07:41,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 18:07:41,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:07:41,256 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 [2019-01-14 18:07:41,257 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:07:41,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 [2019-01-14 18:07:41,270 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 [2019-01-14 18:07:41,271 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 18:07:41,283 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:07:41,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:07:41,295 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2019-01-14 18:07:41,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-14 18:07:41,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2019-01-14 18:07:41,340 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:07:41,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:07:41,353 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. [2019-01-14 18:07:41,353 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2019-01-14 18:07:41,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2019-01-14 18:07:41,706 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 [2019-01-14 18:07:41,706 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:07:41,714 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:07:41,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:07:41,730 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:22 [2019-01-14 18:07:41,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2019-01-14 18:07:41,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2019-01-14 18:07:41,879 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 18:07:41,886 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:07:41,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:07:41,901 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2019-01-14 18:07:42,011 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:42,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 18:07:42,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2019-01-14 18:07:42,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-14 18:07:42,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-14 18:07:42,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=498, Unknown=0, NotChecked=0, Total=552 [2019-01-14 18:07:42,031 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-01-14 18:07:42,811 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2019-01-14 18:07:43,003 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 82 [2019-01-14 18:07:43,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:43,698 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-01-14 18:07:43,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-14 18:07:43,699 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 22 [2019-01-14 18:07:43,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:43,700 INFO L225 Difference]: With dead ends: 25 [2019-01-14 18:07:43,700 INFO L226 Difference]: Without dead ends: 25 [2019-01-14 18:07:43,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=160, Invalid=1172, Unknown=0, NotChecked=0, Total=1332 [2019-01-14 18:07:43,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-14 18:07:43,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-01-14 18:07:43,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-14 18:07:43,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-01-14 18:07:43,705 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-01-14 18:07:43,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:43,705 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-01-14 18:07:43,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-14 18:07:43,705 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-01-14 18:07:43,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-14 18:07:43,706 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:43,706 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:43,706 INFO L423 AbstractCegarLoop]: === Iteration 16 === [cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-14 18:07:43,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:43,706 INFO L82 PathProgramCache]: Analyzing trace with hash -448717078, now seen corresponding path program 2 times [2019-01-14 18:07:43,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:43,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:43,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:43,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 18:07:43,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:43,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:43,980 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:43,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 18:07:43,981 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 [2019-01-14 18:07:43,991 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 18:07:44,017 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 18:07:44,017 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 18:07:44,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:07:44,081 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 [2019-01-14 18:07:44,082 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:07:44,144 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 [2019-01-14 18:07:44,148 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 [2019-01-14 18:07:44,148 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 18:07:44,160 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:07:44,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:07:44,173 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:25, output treesize:15 [2019-01-14 18:07:44,434 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:44,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 18:07:44,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 21 [2019-01-14 18:07:44,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-14 18:07:44,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-14 18:07:44,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2019-01-14 18:07:44,455 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 22 states. [2019-01-14 18:07:45,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:45,367 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-01-14 18:07:45,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 18:07:45,368 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 23 [2019-01-14 18:07:45,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:45,369 INFO L225 Difference]: With dead ends: 28 [2019-01-14 18:07:45,369 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 18:07:45,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=165, Invalid=957, Unknown=0, NotChecked=0, Total=1122 [2019-01-14 18:07:45,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 18:07:45,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 18:07:45,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 18:07:45,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 18:07:45,371 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2019-01-14 18:07:45,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:45,372 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 18:07:45,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-14 18:07:45,372 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 18:07:45,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 18:07:45,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 06:07:45 BoogieIcfgContainer [2019-01-14 18:07:45,377 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 18:07:45,378 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 18:07:45,378 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 18:07:45,378 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 18:07:45,378 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 06:07:32" (3/4) ... [2019-01-14 18:07:45,384 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 18:07:45,391 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrcpy [2019-01-14 18:07:45,391 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-14 18:07:45,391 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-01-14 18:07:45,391 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-01-14 18:07:45,391 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-14 18:07:45,396 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2019-01-14 18:07:45,396 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-14 18:07:45,396 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-14 18:07:45,452 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 18:07:45,452 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 18:07:45,453 INFO L168 Benchmark]: Toolchain (without parser) took 14679.18 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 306.7 MB). Free memory was 951.4 MB in the beginning and 869.9 MB in the end (delta: 81.4 MB). Peak memory consumption was 388.2 MB. Max. memory is 11.5 GB. [2019-01-14 18:07:45,455 INFO L168 Benchmark]: CDTParser took 0.18 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. [2019-01-14 18:07:45,455 INFO L168 Benchmark]: CACSL2BoogieTranslator took 613.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -157.7 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2019-01-14 18:07:45,456 INFO L168 Benchmark]: Boogie Preprocessor took 65.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-01-14 18:07:45,457 INFO L168 Benchmark]: RCFGBuilder took 629.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 11.5 GB. [2019-01-14 18:07:45,458 INFO L168 Benchmark]: TraceAbstraction took 13291.78 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 184.0 MB). Free memory was 1.1 GB in the beginning and 879.2 MB in the end (delta: 176.6 MB). Peak memory consumption was 360.6 MB. Max. memory is 11.5 GB. [2019-01-14 18:07:45,458 INFO L168 Benchmark]: Witness Printer took 74.34 ms. Allocated memory is still 1.3 GB. Free memory was 879.2 MB in the beginning and 869.9 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 11.5 GB. [2019-01-14 18:07:45,465 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 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 613.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -157.7 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 65.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 629.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13291.78 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 184.0 MB). Free memory was 1.1 GB in the beginning and 879.2 MB in the end (delta: 176.6 MB). Peak memory consumption was 360.6 MB. Max. memory is 11.5 GB. * Witness Printer took 74.34 ms. Allocated memory is still 1.3 GB. Free memory was 879.2 MB in the beginning and 869.9 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. 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.2s OverallTime, 16 OverallIterations, 3 TraceHistogramMax, 6.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 325 SDtfs, 322 SDslu, 1244 SDs, 0 SdLazy, 1196 SolverSat, 122 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 248 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 8.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 49 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 329 NumberOfCodeBlocks, 329 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 309 ConstructedInterpolants, 14 QuantifiedInterpolants, 46107 SizeOfPredicates, 66 NumberOfNonLiveVariables, 612 ConjunctsInSsa, 190 ConjunctsInUnsatCore, 20 InterpolantComputations, 12 PerfectInterpolantSequences, 6/50 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...