./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/array-memsafety/openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2e94e6aa 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/openbsd_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 834e1cdb1aa87972c4591e301e8fffc5992d43b8 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 17:13:22,661 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 17:13:22,668 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 17:13:22,689 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 17:13:22,689 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 17:13:22,691 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 17:13:22,694 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 17:13:22,698 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 17:13:22,700 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 17:13:22,701 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 17:13:22,704 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 17:13:22,704 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 17:13:22,706 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 17:13:22,709 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 17:13:22,716 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 17:13:22,720 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 17:13:22,721 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 17:13:22,726 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 17:13:22,728 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 17:13:22,732 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 17:13:22,733 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 17:13:22,736 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 17:13:22,742 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 17:13:22,743 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 17:13:22,744 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 17:13:22,745 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 17:13:22,746 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 17:13:22,749 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 17:13:22,750 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 17:13:22,751 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 17:13:22,752 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 17:13:22,752 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 17:13:22,754 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 17:13:22,755 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 17:13:22,756 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 17:13:22,757 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 17:13:22,757 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-01 17:13:22,792 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 17:13:22,792 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 17:13:22,794 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 17:13:22,795 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 17:13:22,798 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 17:13:22,798 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 17:13:22,798 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 17:13:22,799 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 17:13:22,799 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 17:13:22,799 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 17:13:22,799 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 17:13:22,800 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-01 17:13:22,800 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-01 17:13:22,800 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-01 17:13:22,800 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 17:13:22,800 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 17:13:22,800 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 17:13:22,801 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 17:13:22,802 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 17:13:22,802 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 17:13:22,802 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 17:13:22,802 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 17:13:22,802 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 17:13:22,803 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 17:13:22,803 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 17:13:22,803 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 17:13:22,803 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 -> 834e1cdb1aa87972c4591e301e8fffc5992d43b8 [2019-01-01 17:13:22,858 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 17:13:22,874 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 17:13:22,880 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 17:13:22,882 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 17:13:22,883 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 17:13:22,884 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2019-01-01 17:13:22,951 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a2d1d021/09d7e8770c7a467bb228877a66023154/FLAG8dd6b90e7 [2019-01-01 17:13:23,496 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 17:13:23,497 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2019-01-01 17:13:23,510 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a2d1d021/09d7e8770c7a467bb228877a66023154/FLAG8dd6b90e7 [2019-01-01 17:13:23,769 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a2d1d021/09d7e8770c7a467bb228877a66023154 [2019-01-01 17:13:23,772 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 17:13:23,774 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-01 17:13:23,775 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 17:13:23,775 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 17:13:23,779 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 17:13:23,780 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 05:13:23" (1/1) ... [2019-01-01 17:13:23,784 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@135a8689 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:23, skipping insertion in model container [2019-01-01 17:13:23,785 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 05:13:23" (1/1) ... [2019-01-01 17:13:23,795 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 17:13:23,840 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 17:13:24,261 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 17:13:24,279 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 17:13:24,323 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 17:13:24,384 INFO L195 MainTranslator]: Completed translation [2019-01-01 17:13:24,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:24 WrapperNode [2019-01-01 17:13:24,385 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 17:13:24,386 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 17:13:24,386 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 17:13:24,386 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 17:13:24,475 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:24" (1/1) ... [2019-01-01 17:13:24,476 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:24" (1/1) ... [2019-01-01 17:13:24,498 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:24" (1/1) ... [2019-01-01 17:13:24,498 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:24" (1/1) ... [2019-01-01 17:13:24,519 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:24" (1/1) ... [2019-01-01 17:13:24,530 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:24" (1/1) ... [2019-01-01 17:13:24,536 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:24" (1/1) ... [2019-01-01 17:13:24,552 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 17:13:24,552 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 17:13:24,552 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 17:13:24,553 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 17:13:24,553 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:24" (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-01 17:13:24,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-01 17:13:24,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 17:13:24,625 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-01 17:13:24,625 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-01 17:13:24,625 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrcpy [2019-01-01 17:13:24,625 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-01 17:13:24,626 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-01 17:13:24,626 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-01 17:13:24,626 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-01 17:13:24,626 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-01 17:13:24,626 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-01 17:13:24,626 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-01 17:13:24,626 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-01 17:13:24,627 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-01 17:13:24,627 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-01 17:13:24,627 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-01 17:13:24,627 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-01 17:13:24,627 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-01 17:13:24,627 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-01 17:13:24,628 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-01 17:13:24,628 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-01 17:13:24,628 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-01 17:13:24,628 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-01 17:13:24,628 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-01 17:13:24,629 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-01 17:13:24,629 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-01 17:13:24,629 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-01 17:13:24,629 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-01 17:13:24,629 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-01 17:13:24,629 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-01 17:13:24,630 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-01 17:13:24,630 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-01 17:13:24,630 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-01 17:13:24,630 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-01 17:13:24,630 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-01 17:13:24,630 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-01 17:13:24,631 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-01 17:13:24,631 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-01 17:13:24,631 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-01 17:13:24,631 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-01 17:13:24,631 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-01 17:13:24,631 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-01 17:13:24,631 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-01 17:13:24,632 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-01 17:13:24,632 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-01 17:13:24,632 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-01 17:13:24,632 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-01 17:13:24,632 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-01 17:13:24,632 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-01 17:13:24,632 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-01 17:13:24,632 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-01 17:13:24,637 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-01 17:13:24,638 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-01 17:13:24,638 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-01 17:13:24,638 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-01 17:13:24,638 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-01 17:13:24,638 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-01 17:13:24,639 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-01 17:13:24,639 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-01 17:13:24,639 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-01 17:13:24,639 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-01 17:13:24,639 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-01 17:13:24,639 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-01 17:13:24,640 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-01 17:13:24,640 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-01 17:13:24,640 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-01 17:13:24,640 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-01 17:13:24,640 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-01 17:13:24,640 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-01 17:13:24,641 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-01 17:13:24,641 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-01 17:13:24,644 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-01 17:13:24,644 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-01 17:13:24,644 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-01 17:13:24,644 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-01 17:13:24,644 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-01 17:13:24,644 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-01 17:13:24,644 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-01 17:13:24,645 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-01 17:13:24,645 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-01 17:13:24,645 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-01 17:13:24,645 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-01 17:13:24,645 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-01 17:13:24,645 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-01 17:13:24,647 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-01 17:13:24,647 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-01 17:13:24,647 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-01 17:13:24,648 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-01 17:13:24,648 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-01 17:13:24,648 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-01 17:13:24,648 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-01 17:13:24,651 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-01 17:13:24,651 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-01 17:13:24,651 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-01 17:13:24,651 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-01 17:13:24,652 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-01 17:13:24,652 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-01 17:13:24,652 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-01 17:13:24,652 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-01 17:13:24,652 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-01 17:13:24,655 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-01 17:13:24,655 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-01 17:13:24,655 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-01 17:13:24,655 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-01 17:13:24,655 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-01 17:13:24,655 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-01 17:13:24,655 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-01 17:13:24,656 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-01 17:13:24,656 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-01 17:13:24,656 INFO L130 BoogieDeclarations]: Found specification of procedure cstrcpy [2019-01-01 17:13:24,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 17:13:24,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 17:13:24,656 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-01 17:13:24,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 17:13:24,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 17:13:24,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-01 17:13:24,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 17:13:25,338 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 17:13:25,338 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2019-01-01 17:13:25,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:13:25 BoogieIcfgContainer [2019-01-01 17:13:25,339 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 17:13:25,341 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 17:13:25,341 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 17:13:25,345 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 17:13:25,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 05:13:23" (1/3) ... [2019-01-01 17:13:25,346 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@595db476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 05:13:25, skipping insertion in model container [2019-01-01 17:13:25,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:24" (2/3) ... [2019-01-01 17:13:25,346 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@595db476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 05:13:25, skipping insertion in model container [2019-01-01 17:13:25,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:13:25" (3/3) ... [2019-01-01 17:13:25,349 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2019-01-01 17:13:25,359 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 17:13:25,366 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-01-01 17:13:25,380 INFO L257 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-01-01 17:13:25,407 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 17:13:25,408 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 17:13:25,408 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-01 17:13:25,408 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 17:13:25,408 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 17:13:25,408 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 17:13:25,408 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 17:13:25,408 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 17:13:25,409 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 17:13:25,426 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-01-01 17:13:25,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-01 17:13:25,436 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:25,437 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:25,440 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-01 17:13:25,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:25,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1727668302, now seen corresponding path program 1 times [2019-01-01 17:13:25,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:25,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:25,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:25,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:25,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:25,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:25,638 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-01 17:13:25,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:25,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 17:13:25,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 17:13:25,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 17:13:25,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:13:25,663 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 4 states. [2019-01-01 17:13:25,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:25,789 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2019-01-01 17:13:25,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 17:13:25,791 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-01 17:13:25,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:25,803 INFO L225 Difference]: With dead ends: 35 [2019-01-01 17:13:25,803 INFO L226 Difference]: Without dead ends: 31 [2019-01-01 17:13:25,805 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-01 17:13:25,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-01 17:13:25,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2019-01-01 17:13:25,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-01 17:13:25,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-01-01 17:13:25,847 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 10 [2019-01-01 17:13:25,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:25,848 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-01-01 17:13:25,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 17:13:25,848 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-01-01 17:13:25,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-01 17:13:25,849 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:25,849 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:25,849 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-01 17:13:25,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:25,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1727668328, now seen corresponding path program 1 times [2019-01-01 17:13:25,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:25,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:25,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:25,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:25,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:25,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:25,951 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-01 17:13:25,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:25,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 17:13:25,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 17:13:25,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 17:13:25,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 17:13:25,957 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 3 states. [2019-01-01 17:13:26,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:26,006 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2019-01-01 17:13:26,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 17:13:26,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-01 17:13:26,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:26,008 INFO L225 Difference]: With dead ends: 28 [2019-01-01 17:13:26,009 INFO L226 Difference]: Without dead ends: 28 [2019-01-01 17:13:26,010 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-01 17:13:26,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-01 17:13:26,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-01-01 17:13:26,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-01 17:13:26,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2019-01-01 17:13:26,015 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 10 [2019-01-01 17:13:26,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:26,016 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2019-01-01 17:13:26,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 17:13:26,016 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2019-01-01 17:13:26,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-01 17:13:26,018 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:26,018 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:26,018 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-01 17:13:26,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:26,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1727668329, now seen corresponding path program 1 times [2019-01-01 17:13:26,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:26,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:26,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:26,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:26,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:26,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:26,238 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-01 17:13:26,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:26,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 17:13:26,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 17:13:26,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 17:13:26,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:13:26,240 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 4 states. [2019-01-01 17:13:26,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:26,348 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2019-01-01 17:13:26,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 17:13:26,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-01 17:13:26,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:26,352 INFO L225 Difference]: With dead ends: 33 [2019-01-01 17:13:26,352 INFO L226 Difference]: Without dead ends: 33 [2019-01-01 17:13:26,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:13:26,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-01 17:13:26,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2019-01-01 17:13:26,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-01 17:13:26,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-01-01 17:13:26,363 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 10 [2019-01-01 17:13:26,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:26,363 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-01-01 17:13:26,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 17:13:26,364 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-01-01 17:13:26,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-01 17:13:26,364 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:26,364 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:26,366 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-01 17:13:26,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:26,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1727670224, now seen corresponding path program 1 times [2019-01-01 17:13:26,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:26,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:26,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:26,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:26,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:26,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:26,434 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-01 17:13:26,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:26,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 17:13:26,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 17:13:26,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 17:13:26,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 17:13:26,435 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 3 states. [2019-01-01 17:13:26,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:26,489 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-01-01 17:13:26,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 17:13:26,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-01 17:13:26,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:26,493 INFO L225 Difference]: With dead ends: 30 [2019-01-01 17:13:26,493 INFO L226 Difference]: Without dead ends: 29 [2019-01-01 17:13:26,493 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-01 17:13:26,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-01 17:13:26,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-01 17:13:26,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-01 17:13:26,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2019-01-01 17:13:26,498 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 10 [2019-01-01 17:13:26,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:26,499 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2019-01-01 17:13:26,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 17:13:26,499 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2019-01-01 17:13:26,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-01 17:13:26,499 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:26,500 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:26,500 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-01 17:13:26,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:26,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1727670251, now seen corresponding path program 1 times [2019-01-01 17:13:26,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:26,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:26,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:26,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:26,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:26,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:26,596 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-01 17:13:26,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:26,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 17:13:26,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 17:13:26,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 17:13:26,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:13:26,599 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 4 states. [2019-01-01 17:13:26,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:26,635 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2019-01-01 17:13:26,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 17:13:26,635 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-01 17:13:26,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:26,636 INFO L225 Difference]: With dead ends: 28 [2019-01-01 17:13:26,636 INFO L226 Difference]: Without dead ends: 28 [2019-01-01 17:13:26,637 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-01 17:13:26,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-01 17:13:26,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-01-01 17:13:26,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-01 17:13:26,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-01-01 17:13:26,641 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 10 [2019-01-01 17:13:26,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:26,642 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-01-01 17:13:26,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 17:13:26,642 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-01-01 17:13:26,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-01 17:13:26,642 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:26,643 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:26,643 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-01 17:13:26,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:26,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1920892747, now seen corresponding path program 1 times [2019-01-01 17:13:26,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:26,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:26,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:26,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:26,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:26,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:26,706 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-01 17:13:26,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:26,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 17:13:26,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 17:13:26,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 17:13:26,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 17:13:26,709 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 5 states. [2019-01-01 17:13:27,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:27,076 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2019-01-01 17:13:27,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 17:13:27,077 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-01-01 17:13:27,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:27,078 INFO L225 Difference]: With dead ends: 25 [2019-01-01 17:13:27,081 INFO L226 Difference]: Without dead ends: 25 [2019-01-01 17:13:27,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:13:27,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-01 17:13:27,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-01 17:13:27,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-01 17:13:27,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2019-01-01 17:13:27,090 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 13 [2019-01-01 17:13:27,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:27,091 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-01-01 17:13:27,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 17:13:27,091 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2019-01-01 17:13:27,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-01 17:13:27,092 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:27,092 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:27,092 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-01 17:13:27,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:27,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1920892746, now seen corresponding path program 1 times [2019-01-01 17:13:27,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:27,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:27,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:27,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:27,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:27,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:27,255 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-01 17:13:27,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:27,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 17:13:27,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 17:13:27,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 17:13:27,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-01 17:13:27,257 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 7 states. [2019-01-01 17:13:27,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:27,456 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-01-01 17:13:27,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 17:13:27,457 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-01-01 17:13:27,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:27,460 INFO L225 Difference]: With dead ends: 34 [2019-01-01 17:13:27,463 INFO L226 Difference]: Without dead ends: 34 [2019-01-01 17:13:27,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-01 17:13:27,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-01 17:13:27,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 26. [2019-01-01 17:13:27,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-01 17:13:27,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-01-01 17:13:27,468 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 13 [2019-01-01 17:13:27,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:27,471 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-01-01 17:13:27,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 17:13:27,471 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-01-01 17:13:27,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-01 17:13:27,472 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:27,472 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:27,472 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-01 17:13:27,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:27,472 INFO L82 PathProgramCache]: Analyzing trace with hash 581866964, now seen corresponding path program 1 times [2019-01-01 17:13:27,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:27,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:27,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:27,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:27,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:27,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:27,552 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-01 17:13:27,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:27,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 17:13:27,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 17:13:27,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 17:13:27,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 17:13:27,554 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 5 states. [2019-01-01 17:13:27,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:27,637 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2019-01-01 17:13:27,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 17:13:27,637 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-01-01 17:13:27,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:27,638 INFO L225 Difference]: With dead ends: 25 [2019-01-01 17:13:27,638 INFO L226 Difference]: Without dead ends: 25 [2019-01-01 17:13:27,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:13:27,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-01 17:13:27,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-01 17:13:27,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-01 17:13:27,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2019-01-01 17:13:27,641 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 14 [2019-01-01 17:13:27,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:27,644 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-01-01 17:13:27,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 17:13:27,645 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2019-01-01 17:13:27,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-01 17:13:27,646 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:27,646 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:27,646 INFO L423 AbstractCegarLoop]: === Iteration 9 === [cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-01 17:13:27,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:27,646 INFO L82 PathProgramCache]: Analyzing trace with hash 581866965, now seen corresponding path program 1 times [2019-01-01 17:13:27,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:27,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:27,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:27,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:27,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:27,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:27,825 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-01 17:13:27,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:27,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 17:13:27,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 17:13:27,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 17:13:27,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:13:27,827 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 6 states. [2019-01-01 17:13:27,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:27,934 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-01-01 17:13:27,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 17:13:27,935 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-01-01 17:13:27,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:27,936 INFO L225 Difference]: With dead ends: 31 [2019-01-01 17:13:27,936 INFO L226 Difference]: Without dead ends: 31 [2019-01-01 17:13:27,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-01 17:13:27,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-01 17:13:27,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2019-01-01 17:13:27,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-01 17:13:27,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-01-01 17:13:27,940 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 14 [2019-01-01 17:13:27,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:27,941 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-01-01 17:13:27,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 17:13:27,941 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-01-01 17:13:27,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-01 17:13:27,942 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:27,942 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:27,942 INFO L423 AbstractCegarLoop]: === Iteration 10 === [cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-01 17:13:27,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:27,942 INFO L82 PathProgramCache]: Analyzing trace with hash -89297967, now seen corresponding path program 1 times [2019-01-01 17:13:27,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:27,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:27,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:27,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:27,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:27,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:28,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:28,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:28,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-01 17:13:28,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 17:13:28,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 17:13:28,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-01 17:13:28,186 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 8 states. [2019-01-01 17:13:28,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:28,347 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-01-01 17:13:28,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 17:13:28,351 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-01-01 17:13:28,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:28,352 INFO L225 Difference]: With dead ends: 39 [2019-01-01 17:13:28,352 INFO L226 Difference]: Without dead ends: 39 [2019-01-01 17:13:28,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-01-01 17:13:28,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-01 17:13:28,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2019-01-01 17:13:28,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-01 17:13:28,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-01-01 17:13:28,357 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 17 [2019-01-01 17:13:28,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:28,357 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-01-01 17:13:28,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 17:13:28,357 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2019-01-01 17:13:28,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-01 17:13:28,358 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:28,358 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:28,359 INFO L423 AbstractCegarLoop]: === Iteration 11 === [cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-01 17:13:28,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:28,359 INFO L82 PathProgramCache]: Analyzing trace with hash -482324977, now seen corresponding path program 1 times [2019-01-01 17:13:28,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:28,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:28,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:28,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:28,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:28,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:28,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:28,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:28,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-01 17:13:28,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-01 17:13:28,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 17:13:28,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-01-01 17:13:28,537 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 9 states. [2019-01-01 17:13:28,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:28,751 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2019-01-01 17:13:28,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 17:13:28,760 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2019-01-01 17:13:28,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:28,761 INFO L225 Difference]: With dead ends: 60 [2019-01-01 17:13:28,761 INFO L226 Difference]: Without dead ends: 60 [2019-01-01 17:13:28,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-01-01 17:13:28,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-01 17:13:28,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 37. [2019-01-01 17:13:28,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-01 17:13:28,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2019-01-01 17:13:28,769 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 17 [2019-01-01 17:13:28,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:28,769 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2019-01-01 17:13:28,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-01 17:13:28,769 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2019-01-01 17:13:28,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-01 17:13:28,770 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:28,770 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:28,770 INFO L423 AbstractCegarLoop]: === Iteration 12 === [cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-01 17:13:28,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:28,771 INFO L82 PathProgramCache]: Analyzing trace with hash 218739601, now seen corresponding path program 1 times [2019-01-01 17:13:28,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:28,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:28,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:28,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:28,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:28,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:29,025 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 7 [2019-01-01 17:13:29,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:29,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:13:29,170 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-01 17:13:29,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:29,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:29,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:13:29,299 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-01 17:13:29,305 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-01 17:13:29,305 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:29,312 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:29,326 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-01 17:13:29,326 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-01-01 17:13:29,534 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 18 treesize of output 14 [2019-01-01 17:13:29,558 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 14 treesize of output 11 [2019-01-01 17:13:29,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 17:13:29,568 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:13:29,591 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-01 17:13:29,592 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2019-01-01 17:13:29,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:29,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:13:29,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2019-01-01 17:13:29,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-01 17:13:29,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-01 17:13:29,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-01-01 17:13:29,755 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 15 states. [2019-01-01 17:13:30,154 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 39 [2019-01-01 17:13:32,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:32,575 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2019-01-01 17:13:32,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 17:13:32,576 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2019-01-01 17:13:32,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:32,578 INFO L225 Difference]: With dead ends: 50 [2019-01-01 17:13:32,578 INFO L226 Difference]: Without dead ends: 50 [2019-01-01 17:13:32,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2019-01-01 17:13:32,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-01 17:13:32,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 40. [2019-01-01 17:13:32,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-01 17:13:32,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-01-01 17:13:32,586 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 17 [2019-01-01 17:13:32,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:32,586 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-01-01 17:13:32,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-01 17:13:32,586 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-01-01 17:13:32,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-01 17:13:32,588 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:32,589 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:32,589 INFO L423 AbstractCegarLoop]: === Iteration 13 === [cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-01 17:13:32,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:32,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1809007014, now seen corresponding path program 1 times [2019-01-01 17:13:32,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:32,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:32,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:32,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:32,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:32,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:32,844 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-01 17:13:32,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:13:32,844 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-01 17:13:32,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:32,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:32,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:13:33,049 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-01 17:13:33,061 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-01 17:13:33,062 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:33,205 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-01 17:13:33,250 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-01 17:13:33,250 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:33,347 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:33,486 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-01 17:13:33,486 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:25, output treesize:15 [2019-01-01 17:13:33,880 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-01 17:13:33,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:13:33,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2019-01-01 17:13:33,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-01 17:13:33,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-01 17:13:33,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-01-01 17:13:33,909 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 17 states. [2019-01-01 17:13:34,820 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-01-01 17:13:35,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:35,004 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2019-01-01 17:13:35,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-01 17:13:35,005 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 18 [2019-01-01 17:13:35,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:35,006 INFO L225 Difference]: With dead ends: 56 [2019-01-01 17:13:35,006 INFO L226 Difference]: Without dead ends: 56 [2019-01-01 17:13:35,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=113, Invalid=537, Unknown=0, NotChecked=0, Total=650 [2019-01-01 17:13:35,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-01 17:13:35,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 41. [2019-01-01 17:13:35,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-01 17:13:35,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-01-01 17:13:35,012 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 18 [2019-01-01 17:13:35,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:35,012 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-01-01 17:13:35,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-01 17:13:35,013 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-01-01 17:13:35,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-01 17:13:35,013 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:35,013 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] [2019-01-01 17:13:35,014 INFO L423 AbstractCegarLoop]: === Iteration 14 === [cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-01 17:13:35,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:35,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1744040704, now seen corresponding path program 1 times [2019-01-01 17:13:35,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:35,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:35,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:35,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:35,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:35,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:35,155 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-01 17:13:35,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:35,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 17:13:35,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 17:13:35,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 17:13:35,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:13:35,157 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 4 states. [2019-01-01 17:13:35,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:35,204 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2019-01-01 17:13:35,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 17:13:35,205 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-01-01 17:13:35,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:35,206 INFO L225 Difference]: With dead ends: 40 [2019-01-01 17:13:35,206 INFO L226 Difference]: Without dead ends: 24 [2019-01-01 17:13:35,207 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-01 17:13:35,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-01 17:13:35,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-01-01 17:13:35,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-01 17:13:35,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-01-01 17:13:35,209 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 20 [2019-01-01 17:13:35,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:35,210 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-01-01 17:13:35,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 17:13:35,210 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-01-01 17:13:35,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-01 17:13:35,211 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:35,211 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:35,211 INFO L423 AbstractCegarLoop]: === Iteration 15 === [cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-01 17:13:35,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:35,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1121630508, now seen corresponding path program 2 times [2019-01-01 17:13:35,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:35,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:35,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:35,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:35,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:35,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:35,805 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:35,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:13:35,806 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-01 17:13:35,820 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 17:13:35,860 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 17:13:35,861 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 17:13:35,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:13:35,921 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-01 17:13:35,922 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:35,937 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-01 17:13:35,942 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-01 17:13:35,943 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:35,955 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:35,960 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-01 17:13:35,961 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2019-01-01 17:13:35,985 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-01 17:13:35,988 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-01 17:13:35,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:35,991 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:36,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:36,000 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2019-01-01 17:13:36,121 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-01 17:13:36,124 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-01 17:13:36,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:36,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:36,154 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-01 17:13:36,155 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:22 [2019-01-01 17:13:36,246 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-01 17:13:36,268 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-01 17:13:36,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 17:13:36,273 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:13:36,288 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-01 17:13:36,289 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2019-01-01 17:13:36,373 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:36,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:13:36,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2019-01-01 17:13:36,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-01 17:13:36,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-01 17:13:36,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2019-01-01 17:13:36,393 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 20 states. [2019-01-01 17:13:36,879 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-01-01 17:13:37,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:37,805 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-01-01 17:13:37,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-01 17:13:37,806 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 21 [2019-01-01 17:13:37,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:37,807 INFO L225 Difference]: With dead ends: 25 [2019-01-01 17:13:37,807 INFO L226 Difference]: Without dead ends: 25 [2019-01-01 17:13:37,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=150, Invalid=906, Unknown=0, NotChecked=0, Total=1056 [2019-01-01 17:13:37,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-01 17:13:37,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2019-01-01 17:13:37,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-01 17:13:37,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-01-01 17:13:37,811 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-01-01 17:13:37,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:37,812 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-01-01 17:13:37,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-01 17:13:37,812 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-01-01 17:13:37,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-01 17:13:37,813 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:37,813 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:37,813 INFO L423 AbstractCegarLoop]: === Iteration 16 === [cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-01 17:13:37,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:37,813 INFO L82 PathProgramCache]: Analyzing trace with hash 410807327, now seen corresponding path program 2 times [2019-01-01 17:13:37,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:37,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:37,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:37,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 17:13:37,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:37,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:37,958 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:37,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:13:37,958 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-01 17:13:37,968 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 17:13:37,993 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 17:13:37,993 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 17:13:37,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:13:38,113 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-01 17:13:38,116 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-01 17:13:38,116 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:38,135 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-01 17:13:38,139 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-01 17:13:38,140 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:38,145 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:38,163 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-01 17:13:38,163 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:28, output treesize:18 [2019-01-01 17:13:38,383 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-01 17:13:38,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:13:38,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2019-01-01 17:13:38,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-01 17:13:38,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-01 17:13:38,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-01-01 17:13:38,403 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 15 states. [2019-01-01 17:13:38,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:38,949 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-01-01 17:13:38,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 17:13:38,949 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2019-01-01 17:13:38,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:38,949 INFO L225 Difference]: With dead ends: 28 [2019-01-01 17:13:38,950 INFO L226 Difference]: Without dead ends: 0 [2019-01-01 17:13:38,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2019-01-01 17:13:38,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-01 17:13:38,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-01 17:13:38,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-01 17:13:38,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 17:13:38,951 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-01-01 17:13:38,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:38,951 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 17:13:38,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-01 17:13:38,951 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-01 17:13:38,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-01 17:13:38,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 05:13:38 BoogieIcfgContainer [2019-01-01 17:13:38,957 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 17:13:38,959 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 17:13:38,959 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 17:13:38,959 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 17:13:38,960 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:13:25" (3/4) ... [2019-01-01 17:13:38,964 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-01 17:13:38,973 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrcpy [2019-01-01 17:13:38,973 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-01 17:13:38,973 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-01-01 17:13:38,973 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-01-01 17:13:38,973 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-01 17:13:38,979 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2019-01-01 17:13:38,979 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-01-01 17:13:38,980 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-01 17:13:39,040 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 17:13:39,040 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 17:13:39,041 INFO L168 Benchmark]: Toolchain (without parser) took 15268.39 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 312.0 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -179.7 MB). Peak memory consumption was 132.2 MB. Max. memory is 11.5 GB. [2019-01-01 17:13:39,043 INFO L168 Benchmark]: CDTParser took 0.16 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-01 17:13:39,043 INFO L168 Benchmark]: CACSL2BoogieTranslator took 610.77 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 928.5 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-01-01 17:13:39,045 INFO L168 Benchmark]: Boogie Preprocessor took 166.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 928.5 MB in the beginning and 1.1 GB in the end (delta: -196.0 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. [2019-01-01 17:13:39,045 INFO L168 Benchmark]: RCFGBuilder took 786.47 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: 39.0 MB). Peak memory consumption was 39.0 MB. Max. memory is 11.5 GB. [2019-01-01 17:13:39,047 INFO L168 Benchmark]: TraceAbstraction took 13616.48 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 175.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -53.4 MB). Peak memory consumption was 122.2 MB. Max. memory is 11.5 GB. [2019-01-01 17:13:39,047 INFO L168 Benchmark]: Witness Printer took 81.54 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 11.5 GB. [2019-01-01 17:13:39,053 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.16 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 610.77 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 928.5 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 166.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 928.5 MB in the beginning and 1.1 GB in the end (delta: -196.0 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 786.47 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: 39.0 MB). Peak memory consumption was 39.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13616.48 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 175.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -53.4 MB). Peak memory consumption was 122.2 MB. Max. memory is 11.5 GB. * Witness Printer took 81.54 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 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: 559]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 559]: 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.5s OverallTime, 16 OverallIterations, 3 TraceHistogramMax, 7.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 330 SDtfs, 347 SDslu, 1035 SDs, 0 SdLazy, 908 SolverSat, 135 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 222 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 6.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred 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, 74 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 314 NumberOfCodeBlocks, 314 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 294 ConstructedInterpolants, 11 QuantifiedInterpolants, 36812 SizeOfPredicates, 40 NumberOfNonLiveVariables, 484 ConjunctsInSsa, 131 ConjunctsInUnsatCore, 20 InterpolantComputations, 12 PerfectInterpolantSequences, 3/36 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...