./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/array-memsafety/cstrcpy-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 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/cstrcpy-alloca_true-valid-memsafety_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 109b8bf9931c925f911ad0fbf9e2b946a30b466d ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 17:12:45,555 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 17:12:45,557 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 17:12:45,569 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 17:12:45,570 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 17:12:45,571 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 17:12:45,573 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 17:12:45,575 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 17:12:45,576 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 17:12:45,577 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 17:12:45,578 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 17:12:45,579 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 17:12:45,580 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 17:12:45,581 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 17:12:45,582 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 17:12:45,584 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 17:12:45,584 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 17:12:45,587 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 17:12:45,589 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 17:12:45,591 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 17:12:45,592 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 17:12:45,594 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 17:12:45,597 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 17:12:45,597 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 17:12:45,598 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 17:12:45,599 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 17:12:45,600 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 17:12:45,602 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 17:12:45,603 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 17:12:45,604 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 17:12:45,605 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 17:12:45,605 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 17:12:45,606 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 17:12:45,606 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 17:12:45,607 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 17:12:45,608 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 17:12:45,609 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:12:45,626 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 17:12:45,626 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 17:12:45,628 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 17:12:45,628 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 17:12:45,629 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 17:12:45,629 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 17:12:45,629 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 17:12:45,629 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 17:12:45,629 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 17:12:45,630 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 17:12:45,630 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 17:12:45,630 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-01 17:12:45,630 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-01 17:12:45,632 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-01 17:12:45,632 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 17:12:45,632 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 17:12:45,632 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 17:12:45,633 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 17:12:45,633 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 17:12:45,634 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 17:12:45,634 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 17:12:45,634 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 17:12:45,634 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 17:12:45,634 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 17:12:45,635 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 17:12:45,635 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 17:12:45,635 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 109b8bf9931c925f911ad0fbf9e2b946a30b466d [2019-01-01 17:12:45,673 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 17:12:45,688 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 17:12:45,693 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 17:12:45,694 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 17:12:45,695 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 17:12:45,695 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/cstrcpy-alloca_true-valid-memsafety_true-termination.i [2019-01-01 17:12:45,764 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0e52e1cd/42f602a065414d5982853d1d4f6685f4/FLAGe9f6c3bfb [2019-01-01 17:12:46,239 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 17:12:46,241 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/cstrcpy-alloca_true-valid-memsafety_true-termination.i [2019-01-01 17:12:46,260 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0e52e1cd/42f602a065414d5982853d1d4f6685f4/FLAGe9f6c3bfb [2019-01-01 17:12:46,574 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0e52e1cd/42f602a065414d5982853d1d4f6685f4 [2019-01-01 17:12:46,579 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 17:12:46,580 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-01 17:12:46,583 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 17:12:46,583 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 17:12:46,589 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 17:12:46,590 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 05:12:46" (1/1) ... [2019-01-01 17:12:46,593 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22eac36e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:12:46, skipping insertion in model container [2019-01-01 17:12:46,593 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 05:12:46" (1/1) ... [2019-01-01 17:12:46,601 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 17:12:46,660 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 17:12:47,064 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 17:12:47,086 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 17:12:47,144 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 17:12:47,201 INFO L195 MainTranslator]: Completed translation [2019-01-01 17:12:47,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:12:47 WrapperNode [2019-01-01 17:12:47,202 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 17:12:47,203 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 17:12:47,203 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 17:12:47,203 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 17:12:47,292 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:12:47" (1/1) ... [2019-01-01 17:12:47,293 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:12:47" (1/1) ... [2019-01-01 17:12:47,314 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:12:47" (1/1) ... [2019-01-01 17:12:47,314 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:12:47" (1/1) ... [2019-01-01 17:12:47,329 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:12:47" (1/1) ... [2019-01-01 17:12:47,335 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:12:47" (1/1) ... [2019-01-01 17:12:47,341 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:12:47" (1/1) ... [2019-01-01 17:12:47,354 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 17:12:47,355 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 17:12:47,355 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 17:12:47,355 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 17:12:47,356 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:12:47" (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:12:47,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-01 17:12:47,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 17:12:47,427 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-01 17:12:47,427 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-01 17:12:47,427 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrcpy [2019-01-01 17:12:47,428 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-01 17:12:47,428 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-01 17:12:47,428 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-01 17:12:47,431 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-01 17:12:47,431 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-01 17:12:47,431 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-01 17:12:47,431 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-01 17:12:47,432 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-01 17:12:47,432 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-01 17:12:47,432 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-01 17:12:47,432 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-01 17:12:47,432 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-01 17:12:47,432 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-01 17:12:47,432 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-01 17:12:47,433 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-01 17:12:47,433 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-01 17:12:47,433 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-01 17:12:47,433 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-01 17:12:47,433 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-01 17:12:47,433 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-01 17:12:47,436 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-01 17:12:47,436 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-01 17:12:47,436 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-01 17:12:47,436 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-01 17:12:47,437 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-01 17:12:47,437 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-01 17:12:47,438 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-01 17:12:47,438 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-01 17:12:47,438 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-01 17:12:47,438 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-01 17:12:47,438 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-01 17:12:47,438 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-01 17:12:47,440 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-01 17:12:47,440 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-01 17:12:47,441 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-01 17:12:47,441 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-01 17:12:47,441 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-01 17:12:47,441 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-01 17:12:47,443 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-01 17:12:47,443 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-01 17:12:47,443 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-01 17:12:47,443 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-01 17:12:47,443 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-01 17:12:47,443 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-01 17:12:47,444 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-01 17:12:47,444 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-01 17:12:47,444 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-01 17:12:47,445 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-01 17:12:47,445 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-01 17:12:47,445 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-01 17:12:47,445 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-01 17:12:47,445 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-01 17:12:47,445 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-01 17:12:47,445 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-01 17:12:47,445 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-01 17:12:47,446 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-01 17:12:47,446 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-01 17:12:47,446 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-01 17:12:47,446 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-01 17:12:47,448 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-01 17:12:47,448 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-01 17:12:47,448 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-01 17:12:47,448 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-01 17:12:47,448 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-01 17:12:47,449 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-01 17:12:47,449 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-01 17:12:47,449 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-01 17:12:47,449 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-01 17:12:47,449 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-01 17:12:47,449 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-01 17:12:47,449 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-01 17:12:47,450 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-01 17:12:47,450 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-01 17:12:47,450 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-01 17:12:47,450 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-01 17:12:47,450 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-01 17:12:47,450 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-01 17:12:47,450 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-01 17:12:47,450 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-01 17:12:47,454 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-01 17:12:47,454 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-01 17:12:47,454 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-01 17:12:47,454 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-01 17:12:47,455 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-01 17:12:47,455 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-01 17:12:47,455 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-01 17:12:47,455 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-01 17:12:47,455 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-01 17:12:47,455 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-01 17:12:47,455 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-01 17:12:47,456 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-01 17:12:47,458 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-01 17:12:47,459 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-01 17:12:47,459 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-01 17:12:47,459 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-01 17:12:47,459 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-01 17:12:47,459 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-01 17:12:47,459 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-01 17:12:47,459 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-01 17:12:47,460 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-01 17:12:47,460 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-01 17:12:47,460 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-01 17:12:47,460 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-01 17:12:47,460 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-01 17:12:47,460 INFO L130 BoogieDeclarations]: Found specification of procedure cstrcpy [2019-01-01 17:12:47,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 17:12:47,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 17:12:47,460 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-01 17:12:47,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 17:12:47,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 17:12:47,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-01 17:12:47,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 17:12:47,975 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 17:12:47,975 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2019-01-01 17:12:47,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:12:47 BoogieIcfgContainer [2019-01-01 17:12:47,976 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 17:12:47,977 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 17:12:47,977 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 17:12:47,981 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 17:12:47,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 05:12:46" (1/3) ... [2019-01-01 17:12:47,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@126fee74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 05:12:47, skipping insertion in model container [2019-01-01 17:12:47,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:12:47" (2/3) ... [2019-01-01 17:12:47,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@126fee74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 05:12:47, skipping insertion in model container [2019-01-01 17:12:47,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:12:47" (3/3) ... [2019-01-01 17:12:47,985 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrcpy-alloca_true-valid-memsafety_true-termination.i [2019-01-01 17:12:47,996 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 17:12:48,004 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-01-01 17:12:48,023 INFO L257 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-01-01 17:12:48,052 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 17:12:48,053 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 17:12:48,053 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-01 17:12:48,054 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 17:12:48,054 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 17:12:48,054 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 17:12:48,055 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 17:12:48,055 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 17:12:48,055 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 17:12:48,073 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-01-01 17:12:48,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-01 17:12:48,084 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:12:48,085 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:12:48,089 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-01 17:12:48,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:12:48,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1727668302, now seen corresponding path program 1 times [2019-01-01 17:12:48,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:12:48,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:12:48,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:48,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:12:48,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:48,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:12:48,377 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:12:48,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:12:48,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 17:12:48,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 17:12:48,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 17:12:48,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:12:48,410 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 4 states. [2019-01-01 17:12:48,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:12:48,630 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2019-01-01 17:12:48,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 17:12:48,633 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-01 17:12:48,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:12:48,652 INFO L225 Difference]: With dead ends: 35 [2019-01-01 17:12:48,653 INFO L226 Difference]: Without dead ends: 31 [2019-01-01 17:12:48,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-01 17:12:48,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-01 17:12:48,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2019-01-01 17:12:48,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-01 17:12:48,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-01-01 17:12:48,696 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 10 [2019-01-01 17:12:48,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:12:48,696 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-01-01 17:12:48,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 17:12:48,697 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-01-01 17:12:48,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-01 17:12:48,697 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:12:48,697 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:12:48,699 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-01 17:12:48,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:12:48,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1727668328, now seen corresponding path program 1 times [2019-01-01 17:12:48,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:12:48,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:12:48,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:48,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:12:48,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:48,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:12:48,771 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:12:48,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:12:48,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 17:12:48,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 17:12:48,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 17:12:48,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 17:12:48,775 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 3 states. [2019-01-01 17:12:48,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:12:48,890 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2019-01-01 17:12:48,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 17:12:48,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-01 17:12:48,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:12:48,892 INFO L225 Difference]: With dead ends: 28 [2019-01-01 17:12:48,892 INFO L226 Difference]: Without dead ends: 28 [2019-01-01 17:12:48,893 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:12:48,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-01 17:12:48,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-01-01 17:12:48,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-01 17:12:48,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2019-01-01 17:12:48,898 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 10 [2019-01-01 17:12:48,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:12:48,898 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2019-01-01 17:12:48,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 17:12:48,899 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2019-01-01 17:12:48,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-01 17:12:48,900 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:12:48,900 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:12:48,900 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-01 17:12:48,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:12:48,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1727668329, now seen corresponding path program 1 times [2019-01-01 17:12:48,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:12:48,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:12:48,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:48,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:12:48,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:48,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:12:49,114 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:12:49,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:12:49,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 17:12:49,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 17:12:49,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 17:12:49,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:12:49,116 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 4 states. [2019-01-01 17:12:49,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:12:49,252 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2019-01-01 17:12:49,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 17:12:49,253 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-01 17:12:49,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:12:49,257 INFO L225 Difference]: With dead ends: 33 [2019-01-01 17:12:49,257 INFO L226 Difference]: Without dead ends: 33 [2019-01-01 17:12:49,257 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:12:49,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-01 17:12:49,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2019-01-01 17:12:49,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-01 17:12:49,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-01-01 17:12:49,268 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 10 [2019-01-01 17:12:49,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:12:49,268 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-01-01 17:12:49,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 17:12:49,269 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-01-01 17:12:49,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-01 17:12:49,270 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:12:49,271 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:12:49,271 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-01 17:12:49,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:12:49,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1727670224, now seen corresponding path program 1 times [2019-01-01 17:12:49,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:12:49,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:12:49,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:49,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:12:49,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:49,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:12:49,323 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:12:49,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:12:49,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 17:12:49,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 17:12:49,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 17:12:49,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 17:12:49,325 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 3 states. [2019-01-01 17:12:49,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:12:49,381 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-01-01 17:12:49,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 17:12:49,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-01 17:12:49,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:12:49,384 INFO L225 Difference]: With dead ends: 30 [2019-01-01 17:12:49,384 INFO L226 Difference]: Without dead ends: 29 [2019-01-01 17:12:49,384 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:12:49,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-01 17:12:49,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-01 17:12:49,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-01 17:12:49,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2019-01-01 17:12:49,389 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 10 [2019-01-01 17:12:49,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:12:49,390 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2019-01-01 17:12:49,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 17:12:49,390 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2019-01-01 17:12:49,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-01 17:12:49,390 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:12:49,391 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:12:49,391 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-01 17:12:49,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:12:49,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1727670251, now seen corresponding path program 1 times [2019-01-01 17:12:49,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:12:49,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:12:49,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:49,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:12:49,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:49,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:12:49,721 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 11 [2019-01-01 17:12:49,723 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:12:49,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:12:49,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 17:12:49,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 17:12:49,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 17:12:49,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:12:49,725 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 4 states. [2019-01-01 17:12:49,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:12:49,778 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2019-01-01 17:12:49,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 17:12:49,778 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-01 17:12:49,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:12:49,779 INFO L225 Difference]: With dead ends: 28 [2019-01-01 17:12:49,780 INFO L226 Difference]: Without dead ends: 28 [2019-01-01 17:12:49,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:12:49,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-01 17:12:49,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-01-01 17:12:49,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-01 17:12:49,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-01-01 17:12:49,785 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 10 [2019-01-01 17:12:49,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:12:49,785 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-01-01 17:12:49,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 17:12:49,786 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-01-01 17:12:49,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-01 17:12:49,787 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:12:49,787 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:12:49,787 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-01 17:12:49,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:12:49,788 INFO L82 PathProgramCache]: Analyzing trace with hash 581866994, now seen corresponding path program 1 times [2019-01-01 17:12:49,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:12:49,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:12:49,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:49,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:12:49,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:49,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:12:49,887 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:12:49,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:12:49,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 17:12:49,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 17:12:49,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 17:12:49,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:12:49,889 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 6 states. [2019-01-01 17:12:50,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:12:50,068 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2019-01-01 17:12:50,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 17:12:50,069 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-01-01 17:12:50,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:12:50,071 INFO L225 Difference]: With dead ends: 25 [2019-01-01 17:12:50,071 INFO L226 Difference]: Without dead ends: 25 [2019-01-01 17:12:50,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-01 17:12:50,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-01 17:12:50,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-01 17:12:50,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-01 17:12:50,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2019-01-01 17:12:50,077 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 14 [2019-01-01 17:12:50,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:12:50,077 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-01-01 17:12:50,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 17:12:50,078 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2019-01-01 17:12:50,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-01 17:12:50,078 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:12:50,078 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:12:50,079 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-01 17:12:50,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:12:50,079 INFO L82 PathProgramCache]: Analyzing trace with hash 581866995, now seen corresponding path program 1 times [2019-01-01 17:12:50,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:12:50,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:12:50,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:50,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:12:50,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:50,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:12:50,323 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:12:50,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:12:50,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 17:12:50,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 17:12:50,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 17:12:50,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-01 17:12:50,326 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 8 states. [2019-01-01 17:12:50,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:12:50,797 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-01-01 17:12:50,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 17:12:50,798 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-01-01 17:12:50,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:12:50,799 INFO L225 Difference]: With dead ends: 31 [2019-01-01 17:12:50,799 INFO L226 Difference]: Without dead ends: 31 [2019-01-01 17:12:50,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-01-01 17:12:50,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-01 17:12:50,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2019-01-01 17:12:50,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-01 17:12:50,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-01-01 17:12:50,804 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 14 [2019-01-01 17:12:50,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:12:50,805 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-01-01 17:12:50,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 17:12:50,805 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-01-01 17:12:50,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-01 17:12:50,806 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:12:50,806 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:12:50,806 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-01 17:12:50,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:12:50,807 INFO L82 PathProgramCache]: Analyzing trace with hash 858007609, now seen corresponding path program 1 times [2019-01-01 17:12:50,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:12:50,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:12:50,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:50,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:12:50,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:50,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:12:50,911 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:12:50,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:12:50,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 17:12:50,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 17:12:50,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 17:12:50,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:12:50,913 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 6 states. [2019-01-01 17:12:51,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:12:51,003 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2019-01-01 17:12:51,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 17:12:51,005 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-01-01 17:12:51,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:12:51,006 INFO L225 Difference]: With dead ends: 26 [2019-01-01 17:12:51,006 INFO L226 Difference]: Without dead ends: 26 [2019-01-01 17:12:51,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-01 17:12:51,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-01 17:12:51,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-01 17:12:51,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-01 17:12:51,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-01-01 17:12:51,012 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 15 [2019-01-01 17:12:51,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:12:51,015 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-01-01 17:12:51,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 17:12:51,015 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-01-01 17:12:51,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-01 17:12:51,016 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:12:51,016 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:12:51,016 INFO L423 AbstractCegarLoop]: === Iteration 9 === [cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-01 17:12:51,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:12:51,017 INFO L82 PathProgramCache]: Analyzing trace with hash 858007610, now seen corresponding path program 1 times [2019-01-01 17:12:51,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:12:51,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:12:51,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:51,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:12:51,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:51,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:12:51,219 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:12:51,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:12:51,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 17:12:51,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 17:12:51,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 17:12:51,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-01 17:12:51,221 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 7 states. [2019-01-01 17:12:51,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:12:51,328 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2019-01-01 17:12:51,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 17:12:51,332 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-01-01 17:12:51,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:12:51,333 INFO L225 Difference]: With dead ends: 28 [2019-01-01 17:12:51,333 INFO L226 Difference]: Without dead ends: 28 [2019-01-01 17:12:51,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-01-01 17:12:51,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-01 17:12:51,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-01-01 17:12:51,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-01 17:12:51,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-01-01 17:12:51,337 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 15 [2019-01-01 17:12:51,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:12:51,337 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-01-01 17:12:51,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 17:12:51,337 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-01-01 17:12:51,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-01 17:12:51,338 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:12:51,338 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:12:51,338 INFO L423 AbstractCegarLoop]: === Iteration 10 === [cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-01 17:12:51,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:12:51,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1554286971, now seen corresponding path program 1 times [2019-01-01 17:12:51,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:12:51,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:12:51,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:51,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:12:51,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:12:51,642 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 10 [2019-01-01 17:12:51,704 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:12:51,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:12:51,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-01 17:12:51,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-01 17:12:51,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 17:12:51,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-01-01 17:12:51,705 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 9 states. [2019-01-01 17:12:51,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:12:51,895 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2019-01-01 17:12:51,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 17:12:51,896 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-01-01 17:12:51,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:12:51,897 INFO L225 Difference]: With dead ends: 41 [2019-01-01 17:12:51,897 INFO L226 Difference]: Without dead ends: 41 [2019-01-01 17:12:51,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-01-01 17:12:51,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-01 17:12:51,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2019-01-01 17:12:51,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-01 17:12:51,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2019-01-01 17:12:51,903 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 18 [2019-01-01 17:12:51,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:12:51,903 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2019-01-01 17:12:51,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-01 17:12:51,904 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2019-01-01 17:12:51,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-01 17:12:51,904 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:12:51,905 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:12:51,905 INFO L423 AbstractCegarLoop]: === Iteration 11 === [cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-01 17:12:51,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:12:51,905 INFO L82 PathProgramCache]: Analyzing trace with hash -2039615747, now seen corresponding path program 1 times [2019-01-01 17:12:51,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:12:51,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:12:51,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:51,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:12:51,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:51,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:12:52,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:12:52,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:12:52,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-01 17:12:52,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-01 17:12:52,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 17:12:52,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-01-01 17:12:52,174 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 10 states. [2019-01-01 17:12:52,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:12:52,464 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2019-01-01 17:12:52,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 17:12:52,466 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-01-01 17:12:52,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:12:52,469 INFO L225 Difference]: With dead ends: 64 [2019-01-01 17:12:52,469 INFO L226 Difference]: Without dead ends: 64 [2019-01-01 17:12:52,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2019-01-01 17:12:52,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-01 17:12:52,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 39. [2019-01-01 17:12:52,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-01 17:12:52,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-01-01 17:12:52,475 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 18 [2019-01-01 17:12:52,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:12:52,475 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-01-01 17:12:52,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-01 17:12:52,475 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-01-01 17:12:52,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-01 17:12:52,476 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:12:52,476 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:12:52,476 INFO L423 AbstractCegarLoop]: === Iteration 12 === [cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-01 17:12:52,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:12:52,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1781450309, now seen corresponding path program 1 times [2019-01-01 17:12:52,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:12:52,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:12:52,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:52,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:12:52,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:52,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:12:52,733 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:12:52,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:12:52,734 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:12:52,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:12:52,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:12:52,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:12:52,892 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:12:52,895 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:12:52,896 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:12:52,899 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:12:52,914 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:12:52,915 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-01-01 17:12:53,250 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:12:53,387 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:12:53,388 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 17:12:53,460 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:12:53,504 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:12:53,505 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2019-01-01 17:12:53,634 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:12:53,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:12:53,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2019-01-01 17:12:53,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-01 17:12:53,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-01 17:12:53,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-01-01 17:12:53,656 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 16 states. [2019-01-01 17:12:54,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:12:54,595 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2019-01-01 17:12:54,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 17:12:54,596 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2019-01-01 17:12:54,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:12:54,598 INFO L225 Difference]: With dead ends: 45 [2019-01-01 17:12:54,598 INFO L226 Difference]: Without dead ends: 45 [2019-01-01 17:12:54,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2019-01-01 17:12:54,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-01 17:12:54,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2019-01-01 17:12:54,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-01 17:12:54,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-01-01 17:12:54,604 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 18 [2019-01-01 17:12:54,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:12:54,604 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-01-01 17:12:54,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-01 17:12:54,604 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-01-01 17:12:54,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-01 17:12:54,605 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:12:54,605 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:12:54,606 INFO L423 AbstractCegarLoop]: === Iteration 13 === [cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-01 17:12:54,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:12:54,606 INFO L82 PathProgramCache]: Analyzing trace with hash 609615218, now seen corresponding path program 1 times [2019-01-01 17:12:54,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:12:54,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:12:54,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:54,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:12:54,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:54,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:12:55,499 WARN L181 SmtUtils]: Spent 660.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-01-01 17:12:55,698 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2019-01-01 17:12:55,880 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:12:55,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:12:55,881 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:12:55,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:12:55,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:12:55,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:12:55,972 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:12:55,973 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:12:55,991 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:12:55,996 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:12:55,997 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 17:12:56,011 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:12:56,025 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:12:56,025 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:25, output treesize:15 [2019-01-01 17:12:56,317 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:12:56,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:12:56,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2019-01-01 17:12:56,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-01 17:12:56,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-01 17:12:56,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2019-01-01 17:12:56,340 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 20 states. [2019-01-01 17:12:56,599 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2019-01-01 17:12:57,117 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-01-01 17:12:57,386 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-01-01 17:12:57,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:12:57,758 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2019-01-01 17:12:57,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-01 17:12:57,759 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-01-01 17:12:57,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:12:57,760 INFO L225 Difference]: With dead ends: 47 [2019-01-01 17:12:57,760 INFO L226 Difference]: Without dead ends: 47 [2019-01-01 17:12:57,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=115, Invalid=815, Unknown=0, NotChecked=0, Total=930 [2019-01-01 17:12:57,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-01 17:12:57,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2019-01-01 17:12:57,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-01 17:12:57,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-01-01 17:12:57,766 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 19 [2019-01-01 17:12:57,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:12:57,766 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-01-01 17:12:57,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-01 17:12:57,766 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-01-01 17:12:57,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-01 17:12:57,767 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:12:57,767 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:12:57,767 INFO L423 AbstractCegarLoop]: === Iteration 14 === [cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-01 17:12:57,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:12:57,768 INFO L82 PathProgramCache]: Analyzing trace with hash -322227997, now seen corresponding path program 1 times [2019-01-01 17:12:57,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:12:57,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:12:57,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:57,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:12:57,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:57,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:12:57,852 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:12:57,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:12:57,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 17:12:57,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 17:12:57,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 17:12:57,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:12:57,854 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 4 states. [2019-01-01 17:12:57,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:12:57,904 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2019-01-01 17:12:57,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 17:12:57,905 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-01-01 17:12:57,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:12:57,906 INFO L225 Difference]: With dead ends: 42 [2019-01-01 17:12:57,906 INFO L226 Difference]: Without dead ends: 25 [2019-01-01 17:12:57,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:12:57,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-01 17:12:57,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-01 17:12:57,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-01 17:12:57,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-01-01 17:12:57,910 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 21 [2019-01-01 17:12:57,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:12:57,911 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-01-01 17:12:57,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 17:12:57,911 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-01-01 17:12:57,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-01 17:12:57,911 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:12:57,912 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:12:57,912 INFO L423 AbstractCegarLoop]: === Iteration 15 === [cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-01 17:12:57,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:12:57,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1925187907, now seen corresponding path program 2 times [2019-01-01 17:12:57,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:12:57,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:12:57,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:57,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:12:57,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:57,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:12:58,561 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:12:58,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:12:58,562 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:12:58,574 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 17:12:58,622 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 17:12:58,622 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 17:12:58,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:12:58,728 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:12:58,729 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:12:58,736 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:12:58,744 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:12:58,745 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 17:12:58,750 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:12:58,757 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:12:58,758 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2019-01-01 17:12:58,787 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:12:58,790 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:12:58,790 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:12:58,792 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:12:58,800 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:12:58,801 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2019-01-01 17:12:59,050 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:12:59,054 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:12:59,054 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:12:59,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:12:59,075 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:12:59,076 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:22 [2019-01-01 17:12:59,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2019-01-01 17:12:59,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2019-01-01 17:12:59,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 17:12:59,219 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:12:59,232 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:12:59,232 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2019-01-01 17:12:59,353 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:12:59,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:12:59,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2019-01-01 17:12:59,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-01 17:12:59,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-01 17:12:59,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=498, Unknown=0, NotChecked=0, Total=552 [2019-01-01 17:12:59,375 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-01-01 17:13:00,173 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2019-01-01 17:13:00,368 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 82 [2019-01-01 17:13:01,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:01,077 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-01-01 17:13:01,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-01 17:13:01,079 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 22 [2019-01-01 17:13:01,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:01,080 INFO L225 Difference]: With dead ends: 25 [2019-01-01 17:13:01,080 INFO L226 Difference]: Without dead ends: 25 [2019-01-01 17:13:01,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=160, Invalid=1172, Unknown=0, NotChecked=0, Total=1332 [2019-01-01 17:13:01,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-01 17:13:01,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-01-01 17:13:01,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-01 17:13:01,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-01-01 17:13:01,084 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-01-01 17:13:01,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:01,085 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-01-01 17:13:01,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-01 17:13:01,085 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-01-01 17:13:01,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-01 17:13:01,085 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:01,086 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:01,086 INFO L423 AbstractCegarLoop]: === Iteration 16 === [cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-01 17:13:01,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:01,086 INFO L82 PathProgramCache]: Analyzing trace with hash -448717078, now seen corresponding path program 2 times [2019-01-01 17:13:01,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:01,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:01,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:01,087 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 17:13:01,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:01,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:01,316 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-01 17:13:01,681 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:01,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:13:01,682 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:01,691 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 17:13:01,725 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 17:13:01,725 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 17:13:01,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:13:01,842 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-01 17:13:01,845 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:01,845 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:01,858 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:01,863 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:01,864 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:01,876 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:01,885 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:01,886 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:25, output treesize:15 [2019-01-01 17:13:02,142 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:02,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:13:02,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 21 [2019-01-01 17:13:02,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-01 17:13:02,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-01 17:13:02,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2019-01-01 17:13:02,164 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 22 states. [2019-01-01 17:13:03,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:03,237 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-01-01 17:13:03,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-01 17:13:03,238 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 23 [2019-01-01 17:13:03,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:03,238 INFO L225 Difference]: With dead ends: 28 [2019-01-01 17:13:03,239 INFO L226 Difference]: Without dead ends: 0 [2019-01-01 17:13:03,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=165, Invalid=957, Unknown=0, NotChecked=0, Total=1122 [2019-01-01 17:13:03,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-01 17:13:03,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-01 17:13:03,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-01 17:13:03,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 17:13:03,241 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2019-01-01 17:13:03,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:03,242 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 17:13:03,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-01 17:13:03,242 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-01 17:13:03,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-01 17:13:03,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 05:13:03 BoogieIcfgContainer [2019-01-01 17:13:03,248 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 17:13:03,248 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 17:13:03,249 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 17:13:03,249 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 17:13:03,249 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:12:47" (3/4) ... [2019-01-01 17:13:03,253 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-01 17:13:03,261 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrcpy [2019-01-01 17:13:03,261 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-01 17:13:03,262 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-01-01 17:13:03,262 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-01-01 17:13:03,262 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-01 17:13:03,267 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2019-01-01 17:13:03,267 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-01 17:13:03,268 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-01 17:13:03,319 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 17:13:03,319 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 17:13:03,320 INFO L168 Benchmark]: Toolchain (without parser) took 16740.88 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 297.3 MB). Free memory was 946.0 MB in the beginning and 874.4 MB in the end (delta: 71.6 MB). Peak memory consumption was 368.9 MB. Max. memory is 11.5 GB. [2019-01-01 17:13:03,321 INFO L168 Benchmark]: CDTParser took 0.41 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 17:13:03,322 INFO L168 Benchmark]: CACSL2BoogieTranslator took 619.51 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 924.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:03,322 INFO L168 Benchmark]: Boogie Preprocessor took 151.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 924.5 MB in the beginning and 1.1 GB in the end (delta: -190.4 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2019-01-01 17:13:03,323 INFO L168 Benchmark]: RCFGBuilder took 621.24 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: 38.1 MB). Peak memory consumption was 38.1 MB. Max. memory is 11.5 GB. [2019-01-01 17:13:03,324 INFO L168 Benchmark]: TraceAbstraction took 15271.45 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 170.4 MB). Free memory was 1.1 GB in the beginning and 874.4 MB in the end (delta: 202.5 MB). Peak memory consumption was 372.9 MB. Max. memory is 11.5 GB. [2019-01-01 17:13:03,324 INFO L168 Benchmark]: Witness Printer took 70.90 ms. Allocated memory is still 1.3 GB. Free memory is still 874.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 17:13:03,328 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.41 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 619.51 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 924.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 151.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 924.5 MB in the beginning and 1.1 GB in the end (delta: -190.4 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 621.24 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: 38.1 MB). Peak memory consumption was 38.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15271.45 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 170.4 MB). Free memory was 1.1 GB in the beginning and 874.4 MB in the end (delta: 202.5 MB). Peak memory consumption was 372.9 MB. Max. memory is 11.5 GB. * Witness Printer took 70.90 ms. Allocated memory is still 1.3 GB. Free memory is still 874.4 MB. There was no memory consumed. 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: 560]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 560]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - 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, 15.2s OverallTime, 16 OverallIterations, 3 TraceHistogramMax, 7.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 325 SDtfs, 322 SDslu, 1244 SDs, 0 SdLazy, 1196 SolverSat, 122 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 248 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 9.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 49 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 329 NumberOfCodeBlocks, 329 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 309 ConstructedInterpolants, 14 QuantifiedInterpolants, 46107 SizeOfPredicates, 66 NumberOfNonLiveVariables, 612 ConjunctsInSsa, 190 ConjunctsInUnsatCore, 20 InterpolantComputations, 12 PerfectInterpolantSequences, 6/50 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...