./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/array-memsafety/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/array-memsafety/openbsd_cstrncpy-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 bb65be693a5a8084c5f6f02ff3a6e18ec8f053b3 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-13 21:56:45,565 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 21:56:45,566 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 21:56:45,586 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 21:56:45,586 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 21:56:45,587 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 21:56:45,588 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 21:56:45,591 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 21:56:45,592 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 21:56:45,593 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 21:56:45,594 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 21:56:45,595 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 21:56:45,596 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 21:56:45,597 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 21:56:45,598 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 21:56:45,599 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 21:56:45,600 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 21:56:45,602 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 21:56:45,605 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 21:56:45,606 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 21:56:45,608 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 21:56:45,609 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 21:56:45,612 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 21:56:45,612 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 21:56:45,612 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 21:56:45,613 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 21:56:45,615 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 21:56:45,616 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 21:56:45,617 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 21:56:45,618 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 21:56:45,618 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 21:56:45,620 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 21:56:45,620 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 21:56:45,620 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 21:56:45,621 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 21:56:45,622 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 21:56:45,623 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-13 21:56:45,638 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 21:56:45,640 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 21:56:45,641 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 21:56:45,641 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 21:56:45,641 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 21:56:45,642 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 21:56:45,642 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 21:56:45,642 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-13 21:56:45,643 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 21:56:45,643 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 21:56:45,643 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 21:56:45,643 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-13 21:56:45,643 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-13 21:56:45,643 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-13 21:56:45,644 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 21:56:45,645 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 21:56:45,645 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 21:56:45,645 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 21:56:45,645 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 21:56:45,645 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 21:56:45,646 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 21:56:45,646 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 21:56:45,646 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 21:56:45,646 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 21:56:45,646 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 21:56:45,646 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 21:56:45,648 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 -> bb65be693a5a8084c5f6f02ff3a6e18ec8f053b3 [2019-01-13 21:56:45,685 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 21:56:45,698 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 21:56:45,701 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 21:56:45,703 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 21:56:45,704 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 21:56:45,704 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2019-01-13 21:56:45,762 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdd447c1f/6004809dce8f4e1080e26ba779bd3005/FLAGe314c170a [2019-01-13 21:56:46,232 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 21:56:46,233 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2019-01-13 21:56:46,250 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdd447c1f/6004809dce8f4e1080e26ba779bd3005/FLAGe314c170a [2019-01-13 21:56:46,535 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdd447c1f/6004809dce8f4e1080e26ba779bd3005 [2019-01-13 21:56:46,538 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 21:56:46,539 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-13 21:56:46,540 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 21:56:46,540 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 21:56:46,544 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 21:56:46,545 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 09:56:46" (1/1) ... [2019-01-13 21:56:46,548 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@453f9d2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:46, skipping insertion in model container [2019-01-13 21:56:46,548 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 09:56:46" (1/1) ... [2019-01-13 21:56:46,556 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 21:56:46,601 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 21:56:46,909 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 21:56:46,923 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 21:56:46,980 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 21:56:47,046 INFO L195 MainTranslator]: Completed translation [2019-01-13 21:56:47,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:47 WrapperNode [2019-01-13 21:56:47,047 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 21:56:47,047 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 21:56:47,048 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 21:56:47,048 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 21:56:47,125 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:47" (1/1) ... [2019-01-13 21:56:47,126 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:47" (1/1) ... [2019-01-13 21:56:47,141 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:47" (1/1) ... [2019-01-13 21:56:47,141 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:47" (1/1) ... [2019-01-13 21:56:47,154 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:47" (1/1) ... [2019-01-13 21:56:47,160 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:47" (1/1) ... [2019-01-13 21:56:47,170 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:47" (1/1) ... [2019-01-13 21:56:47,180 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 21:56:47,181 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 21:56:47,181 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 21:56:47,181 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 21:56:47,184 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56: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-13 21:56:47,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-13 21:56:47,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 21:56:47,238 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-13 21:56:47,238 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-13 21:56:47,238 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrncpy [2019-01-13 21:56:47,238 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-13 21:56:47,238 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-13 21:56:47,238 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-13 21:56:47,238 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-13 21:56:47,239 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-13 21:56:47,240 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-13 21:56:47,240 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-13 21:56:47,240 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-13 21:56:47,240 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-13 21:56:47,240 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-13 21:56:47,241 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-13 21:56:47,241 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-13 21:56:47,241 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-13 21:56:47,242 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-13 21:56:47,242 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-13 21:56:47,242 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-13 21:56:47,242 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-13 21:56:47,243 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-13 21:56:47,243 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-13 21:56:47,243 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-13 21:56:47,243 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-13 21:56:47,243 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-13 21:56:47,243 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-13 21:56:47,244 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-13 21:56:47,244 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-13 21:56:47,244 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-13 21:56:47,244 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-13 21:56:47,244 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-13 21:56:47,244 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-13 21:56:47,245 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-13 21:56:47,246 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-13 21:56:47,247 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-13 21:56:47,247 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-13 21:56:47,247 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-13 21:56:47,247 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-13 21:56:47,247 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-13 21:56:47,248 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-13 21:56:47,248 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-13 21:56:47,248 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-13 21:56:47,249 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-13 21:56:47,249 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-13 21:56:47,249 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-13 21:56:47,249 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-13 21:56:47,249 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-13 21:56:47,249 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-13 21:56:47,249 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-13 21:56:47,249 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-13 21:56:47,250 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-13 21:56:47,250 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-13 21:56:47,250 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-13 21:56:47,250 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-13 21:56:47,250 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-13 21:56:47,250 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-13 21:56:47,250 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-13 21:56:47,250 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-13 21:56:47,251 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-13 21:56:47,251 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-13 21:56:47,251 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-13 21:56:47,251 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-13 21:56:47,251 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-13 21:56:47,251 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-13 21:56:47,251 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-13 21:56:47,251 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-13 21:56:47,252 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-13 21:56:47,254 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-13 21:56:47,255 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-13 21:56:47,255 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-13 21:56:47,255 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-13 21:56:47,255 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-13 21:56:47,255 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-13 21:56:47,255 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-13 21:56:47,255 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-13 21:56:47,255 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-13 21:56:47,256 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-13 21:56:47,256 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-13 21:56:47,256 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-13 21:56:47,256 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-13 21:56:47,256 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-13 21:56:47,256 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-13 21:56:47,256 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-13 21:56:47,256 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-13 21:56:47,257 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-13 21:56:47,258 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-13 21:56:47,259 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-13 21:56:47,259 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-13 21:56:47,259 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-13 21:56:47,259 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-13 21:56:47,259 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-13 21:56:47,259 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-13 21:56:47,259 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-13 21:56:47,259 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-13 21:56:47,260 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-13 21:56:47,261 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-13 21:56:47,261 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-13 21:56:47,261 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-13 21:56:47,261 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-13 21:56:47,261 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-13 21:56:47,261 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-13 21:56:47,262 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-13 21:56:47,262 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-13 21:56:47,263 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-13 21:56:47,263 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-13 21:56:47,263 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-13 21:56:47,263 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-13 21:56:47,263 INFO L130 BoogieDeclarations]: Found specification of procedure cstrncpy [2019-01-13 21:56:47,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-13 21:56:47,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 21:56:47,263 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-13 21:56:47,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 21:56:47,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 21:56:47,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-13 21:56:47,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 21:56:47,945 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 21:56:47,945 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-01-13 21:56:47,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 09:56:47 BoogieIcfgContainer [2019-01-13 21:56:47,946 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 21:56:47,947 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 21:56:47,947 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 21:56:47,950 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 21:56:47,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 09:56:46" (1/3) ... [2019-01-13 21:56:47,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b5672af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 09:56:47, skipping insertion in model container [2019-01-13 21:56:47,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:47" (2/3) ... [2019-01-13 21:56:47,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b5672af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 09:56:47, skipping insertion in model container [2019-01-13 21:56:47,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 09:56:47" (3/3) ... [2019-01-13 21:56:47,954 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2019-01-13 21:56:47,963 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 21:56:47,971 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2019-01-13 21:56:47,988 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2019-01-13 21:56:48,014 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 21:56:48,014 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 21:56:48,015 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-13 21:56:48,015 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 21:56:48,015 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 21:56:48,015 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 21:56:48,015 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 21:56:48,015 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 21:56:48,016 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 21:56:48,031 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2019-01-13 21:56:48,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-13 21:56:48,041 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:48,042 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:48,045 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:48,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:48,050 INFO L82 PathProgramCache]: Analyzing trace with hash 412779915, now seen corresponding path program 1 times [2019-01-13 21:56:48,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:48,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:48,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:48,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:48,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:48,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:48,222 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-13 21:56:48,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:48,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 21:56:48,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 21:56:48,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 21:56:48,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 21:56:48,240 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2019-01-13 21:56:48,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:48,341 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2019-01-13 21:56:48,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 21:56:48,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-13 21:56:48,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:48,352 INFO L225 Difference]: With dead ends: 39 [2019-01-13 21:56:48,352 INFO L226 Difference]: Without dead ends: 36 [2019-01-13 21:56:48,354 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-13 21:56:48,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-13 21:56:48,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-01-13 21:56:48,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-13 21:56:48,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2019-01-13 21:56:48,391 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 10 [2019-01-13 21:56:48,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:48,391 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2019-01-13 21:56:48,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 21:56:48,391 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2019-01-13 21:56:48,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-13 21:56:48,392 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:48,392 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:48,393 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:48,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:48,393 INFO L82 PathProgramCache]: Analyzing trace with hash 412779916, now seen corresponding path program 1 times [2019-01-13 21:56:48,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:48,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:48,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:48,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:48,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:48,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:48,571 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-13 21:56:48,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:48,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 21:56:48,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 21:56:48,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 21:56:48,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:56:48,574 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 4 states. [2019-01-13 21:56:48,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:48,625 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2019-01-13 21:56:48,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 21:56:48,626 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-13 21:56:48,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:48,627 INFO L225 Difference]: With dead ends: 35 [2019-01-13 21:56:48,627 INFO L226 Difference]: Without dead ends: 35 [2019-01-13 21:56:48,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:56:48,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-13 21:56:48,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-01-13 21:56:48,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-13 21:56:48,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2019-01-13 21:56:48,634 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 10 [2019-01-13 21:56:48,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:48,634 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2019-01-13 21:56:48,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 21:56:48,635 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2019-01-13 21:56:48,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-13 21:56:48,635 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:48,635 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:48,636 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:48,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:48,636 INFO L82 PathProgramCache]: Analyzing trace with hash 472169900, now seen corresponding path program 1 times [2019-01-13 21:56:48,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:48,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:48,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:48,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:48,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:48,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:48,907 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-13 21:56:48,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:48,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 21:56:48,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 21:56:48,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 21:56:48,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-13 21:56:48,909 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand 7 states. [2019-01-13 21:56:49,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:49,105 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2019-01-13 21:56:49,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 21:56:49,106 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-01-13 21:56:49,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:49,111 INFO L225 Difference]: With dead ends: 37 [2019-01-13 21:56:49,111 INFO L226 Difference]: Without dead ends: 37 [2019-01-13 21:56:49,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-01-13 21:56:49,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-13 21:56:49,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2019-01-13 21:56:49,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-13 21:56:49,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2019-01-13 21:56:49,120 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 15 [2019-01-13 21:56:49,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:49,120 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2019-01-13 21:56:49,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 21:56:49,121 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2019-01-13 21:56:49,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-13 21:56:49,121 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:49,122 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:49,122 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:49,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:49,122 INFO L82 PathProgramCache]: Analyzing trace with hash 472169901, now seen corresponding path program 1 times [2019-01-13 21:56:49,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:49,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:49,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:49,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:49,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:49,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:49,410 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-13 21:56:49,566 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-13 21:56:49,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:49,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 21:56:49,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 21:56:49,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 21:56:49,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-01-13 21:56:49,568 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 9 states. [2019-01-13 21:56:49,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:49,861 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2019-01-13 21:56:49,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 21:56:49,862 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-01-13 21:56:49,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:49,864 INFO L225 Difference]: With dead ends: 40 [2019-01-13 21:56:49,864 INFO L226 Difference]: Without dead ends: 40 [2019-01-13 21:56:49,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-01-13 21:56:49,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-13 21:56:49,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2019-01-13 21:56:49,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-13 21:56:49,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2019-01-13 21:56:49,871 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 15 [2019-01-13 21:56:49,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:49,874 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2019-01-13 21:56:49,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 21:56:49,874 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2019-01-13 21:56:49,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-13 21:56:49,875 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:49,875 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:49,875 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:49,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:49,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1752364997, now seen corresponding path program 1 times [2019-01-13 21:56:49,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:49,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:49,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:49,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:49,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:49,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:50,045 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-13 21:56:50,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:50,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 21:56:50,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 21:56:50,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 21:56:50,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-13 21:56:50,048 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 8 states. [2019-01-13 21:56:50,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:50,213 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2019-01-13 21:56:50,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 21:56:50,214 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-01-13 21:56:50,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:50,215 INFO L225 Difference]: With dead ends: 38 [2019-01-13 21:56:50,215 INFO L226 Difference]: Without dead ends: 38 [2019-01-13 21:56:50,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-01-13 21:56:50,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-13 21:56:50,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2019-01-13 21:56:50,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-13 21:56:50,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2019-01-13 21:56:50,225 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 16 [2019-01-13 21:56:50,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:50,225 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2019-01-13 21:56:50,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 21:56:50,226 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2019-01-13 21:56:50,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-13 21:56:50,226 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:50,226 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:50,227 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:50,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:50,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1752364998, now seen corresponding path program 1 times [2019-01-13 21:56:50,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:50,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:50,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:50,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:50,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:50,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:50,440 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-13 21:56:50,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:50,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 21:56:50,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 21:56:50,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 21:56:50,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-13 21:56:50,443 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand 8 states. [2019-01-13 21:56:50,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:50,676 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2019-01-13 21:56:50,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 21:56:50,677 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-01-13 21:56:50,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:50,678 INFO L225 Difference]: With dead ends: 37 [2019-01-13 21:56:50,678 INFO L226 Difference]: Without dead ends: 37 [2019-01-13 21:56:50,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-01-13 21:56:50,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-13 21:56:50,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-01-13 21:56:50,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-13 21:56:50,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2019-01-13 21:56:50,683 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 16 [2019-01-13 21:56:50,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:50,684 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2019-01-13 21:56:50,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 21:56:50,684 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2019-01-13 21:56:50,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-13 21:56:50,685 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:50,685 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:50,685 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:50,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:50,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1695369597, now seen corresponding path program 1 times [2019-01-13 21:56:50,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:50,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:50,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:50,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:50,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:50,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:50,907 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-13 21:56:50,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:50,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 21:56:50,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 21:56:50,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 21:56:50,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 21:56:50,909 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 5 states. [2019-01-13 21:56:50,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:50,973 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2019-01-13 21:56:50,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 21:56:50,976 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-01-13 21:56:50,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:50,979 INFO L225 Difference]: With dead ends: 48 [2019-01-13 21:56:50,979 INFO L226 Difference]: Without dead ends: 48 [2019-01-13 21:56:50,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 21:56:50,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-13 21:56:51,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2019-01-13 21:56:51,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-13 21:56:51,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2019-01-13 21:56:51,002 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 18 [2019-01-13 21:56:51,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:51,004 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2019-01-13 21:56:51,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 21:56:51,004 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2019-01-13 21:56:51,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-13 21:56:51,005 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:51,005 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:51,005 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:51,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:51,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1898533121, now seen corresponding path program 1 times [2019-01-13 21:56:51,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:51,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:51,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:51,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:51,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:51,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:51,123 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-13 21:56:51,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:51,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 21:56:51,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 21:56:51,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 21:56:51,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:56:51,125 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 4 states. [2019-01-13 21:56:51,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:51,219 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2019-01-13 21:56:51,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 21:56:51,220 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-01-13 21:56:51,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:51,221 INFO L225 Difference]: With dead ends: 41 [2019-01-13 21:56:51,222 INFO L226 Difference]: Without dead ends: 33 [2019-01-13 21:56:51,222 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-13 21:56:51,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-13 21:56:51,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2019-01-13 21:56:51,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-13 21:56:51,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-01-13 21:56:51,227 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 18 [2019-01-13 21:56:51,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:51,227 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-01-13 21:56:51,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 21:56:51,228 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-01-13 21:56:51,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-13 21:56:51,228 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:51,229 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:51,229 INFO L423 AbstractCegarLoop]: === Iteration 9 === [cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:51,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:51,229 INFO L82 PathProgramCache]: Analyzing trace with hash -2098008373, now seen corresponding path program 1 times [2019-01-13 21:56:51,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:51,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:51,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:51,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:51,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:51,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:51,475 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-13 21:56:51,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:51,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 21:56:51,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 21:56:51,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 21:56:51,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 21:56:51,477 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 5 states. [2019-01-13 21:56:51,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:51,664 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2019-01-13 21:56:51,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 21:56:51,665 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-01-13 21:56:51,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:51,666 INFO L225 Difference]: With dead ends: 29 [2019-01-13 21:56:51,666 INFO L226 Difference]: Without dead ends: 29 [2019-01-13 21:56:51,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-13 21:56:51,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-13 21:56:51,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-13 21:56:51,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-13 21:56:51,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-01-13 21:56:51,669 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 20 [2019-01-13 21:56:51,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:51,669 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-01-13 21:56:51,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 21:56:51,669 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-01-13 21:56:51,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-13 21:56:51,671 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:51,671 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:51,671 INFO L423 AbstractCegarLoop]: === Iteration 10 === [cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:51,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:51,672 INFO L82 PathProgramCache]: Analyzing trace with hash -2098008372, now seen corresponding path program 1 times [2019-01-13 21:56:51,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:51,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:51,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:51,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:51,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:51,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:52,295 WARN L181 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2019-01-13 21:56:52,493 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 5 [2019-01-13 21:56:52,520 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-13 21:56:52,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:52,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 21:56:52,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 21:56:52,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 21:56:52,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 21:56:52,522 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 7 states. [2019-01-13 21:56:52,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:52,650 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2019-01-13 21:56:52,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 21:56:52,652 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-01-13 21:56:52,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:52,653 INFO L225 Difference]: With dead ends: 63 [2019-01-13 21:56:52,653 INFO L226 Difference]: Without dead ends: 61 [2019-01-13 21:56:52,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-01-13 21:56:52,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-13 21:56:52,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 38. [2019-01-13 21:56:52,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-13 21:56:52,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2019-01-13 21:56:52,658 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 20 [2019-01-13 21:56:52,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:52,658 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2019-01-13 21:56:52,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 21:56:52,658 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2019-01-13 21:56:52,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-13 21:56:52,659 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:52,659 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:52,659 INFO L423 AbstractCegarLoop]: === Iteration 11 === [cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:52,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:52,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1610152910, now seen corresponding path program 1 times [2019-01-13 21:56:52,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:52,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:52,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:52,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:52,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:52,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:52,983 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-13 21:56:52,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:52,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-13 21:56:52,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-13 21:56:52,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-13 21:56:52,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-01-13 21:56:52,986 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 11 states. [2019-01-13 21:56:53,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:53,464 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2019-01-13 21:56:53,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 21:56:53,466 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-01-13 21:56:53,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:53,467 INFO L225 Difference]: With dead ends: 44 [2019-01-13 21:56:53,467 INFO L226 Difference]: Without dead ends: 44 [2019-01-13 21:56:53,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-01-13 21:56:53,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-13 21:56:53,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2019-01-13 21:56:53,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-13 21:56:53,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-01-13 21:56:53,471 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 20 [2019-01-13 21:56:53,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:53,472 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-01-13 21:56:53,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-13 21:56:53,472 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-01-13 21:56:53,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-13 21:56:53,473 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:53,473 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:53,473 INFO L423 AbstractCegarLoop]: === Iteration 12 === [cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:53,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:53,473 INFO L82 PathProgramCache]: Analyzing trace with hash -595711829, now seen corresponding path program 1 times [2019-01-13 21:56:53,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:53,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:53,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:53,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:53,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:53,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:53,670 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-13 21:56:53,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:53,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 21:56:53,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 21:56:53,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 21:56:53,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 21:56:53,673 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 7 states. [2019-01-13 21:56:53,899 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-13 21:56:53,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:53,909 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2019-01-13 21:56:53,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 21:56:53,910 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-01-13 21:56:53,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:53,911 INFO L225 Difference]: With dead ends: 44 [2019-01-13 21:56:53,911 INFO L226 Difference]: Without dead ends: 33 [2019-01-13 21:56:53,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-01-13 21:56:53,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-13 21:56:53,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-01-13 21:56:53,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-13 21:56:53,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2019-01-13 21:56:53,914 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 21 [2019-01-13 21:56:53,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:53,914 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2019-01-13 21:56:53,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 21:56:53,915 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2019-01-13 21:56:53,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-13 21:56:53,915 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:53,915 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:53,916 INFO L423 AbstractCegarLoop]: === Iteration 13 === [cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:53,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:53,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1606829079, now seen corresponding path program 1 times [2019-01-13 21:56:53,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:53,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:53,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:53,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:53,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:53,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:54,141 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-13 21:56:54,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:54,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-13 21:56:54,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-13 21:56:54,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-13 21:56:54,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-01-13 21:56:54,143 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 10 states. [2019-01-13 21:56:54,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:54,378 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2019-01-13 21:56:54,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-13 21:56:54,379 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-01-13 21:56:54,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:54,381 INFO L225 Difference]: With dead ends: 51 [2019-01-13 21:56:54,381 INFO L226 Difference]: Without dead ends: 51 [2019-01-13 21:56:54,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-01-13 21:56:54,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-13 21:56:54,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 43. [2019-01-13 21:56:54,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-13 21:56:54,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2019-01-13 21:56:54,387 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 21 [2019-01-13 21:56:54,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:54,387 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2019-01-13 21:56:54,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-13 21:56:54,387 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2019-01-13 21:56:54,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-13 21:56:54,388 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:54,388 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:54,388 INFO L423 AbstractCegarLoop]: === Iteration 14 === [cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:54,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:54,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1408274539, now seen corresponding path program 1 times [2019-01-13 21:56:54,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:54,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:54,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:54,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:54,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:54,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:54,862 WARN L181 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 14 [2019-01-13 21:56:55,032 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-13 21:56:55,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:56:55,033 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-13 21:56:55,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:55,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:55,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:56:55,189 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-13 21:56:55,203 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-13 21:56:55,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:55,229 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:55,323 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-13 21:56:55,324 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-01-13 21:56:55,737 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-13 21:56:55,757 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-13 21:56:55,757 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 21:56:55,763 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:56:55,782 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-13 21:56:55,783 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2019-01-13 21:56:55,842 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-13 21:56:55,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:56:55,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 17 [2019-01-13 21:56:55,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-13 21:56:55,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-13 21:56:55,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2019-01-13 21:56:55,864 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 18 states. [2019-01-13 21:56:56,868 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-01-13 21:56:57,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:57,331 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2019-01-13 21:56:57,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-13 21:56:57,332 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2019-01-13 21:56:57,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:57,334 INFO L225 Difference]: With dead ends: 50 [2019-01-13 21:56:57,334 INFO L226 Difference]: Without dead ends: 50 [2019-01-13 21:56:57,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=93, Invalid=506, Unknown=1, NotChecked=0, Total=600 [2019-01-13 21:56:57,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-13 21:56:57,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2019-01-13 21:56:57,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-13 21:56:57,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2019-01-13 21:56:57,339 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 21 [2019-01-13 21:56:57,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:57,339 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2019-01-13 21:56:57,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-13 21:56:57,340 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2019-01-13 21:56:57,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-13 21:56:57,340 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:57,341 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:57,341 INFO L423 AbstractCegarLoop]: === Iteration 15 === [cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:57,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:57,341 INFO L82 PathProgramCache]: Analyzing trace with hash 706837704, now seen corresponding path program 1 times [2019-01-13 21:56:57,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:57,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:57,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:57,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:57,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:57,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:57,623 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-13 21:56:57,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:56:57,623 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-13 21:56:57,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:57,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:57,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:56:57,713 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-13 21:56:57,714 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:57,727 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-13 21:56:57,771 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-13 21:56:57,771 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:57,791 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:57,798 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-13 21:56:57,799 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2019-01-13 21:56:58,072 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-13 21:56:58,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:56:58,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2019-01-13 21:56:58,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-13 21:56:58,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-13 21:56:58,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2019-01-13 21:56:58,095 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 21 states. [2019-01-13 21:56:58,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:58,959 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2019-01-13 21:56:58,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 21:56:58,960 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 22 [2019-01-13 21:56:58,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:58,962 INFO L225 Difference]: With dead ends: 49 [2019-01-13 21:56:58,962 INFO L226 Difference]: Without dead ends: 49 [2019-01-13 21:56:58,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=111, Invalid=701, Unknown=0, NotChecked=0, Total=812 [2019-01-13 21:56:58,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-13 21:56:58,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2019-01-13 21:56:58,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-13 21:56:58,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2019-01-13 21:56:58,967 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 22 [2019-01-13 21:56:58,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:58,969 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2019-01-13 21:56:58,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-13 21:56:58,969 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2019-01-13 21:56:58,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-13 21:56:58,970 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:58,970 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:58,970 INFO L423 AbstractCegarLoop]: === Iteration 16 === [cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:58,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:58,970 INFO L82 PathProgramCache]: Analyzing trace with hash -2142368762, now seen corresponding path program 1 times [2019-01-13 21:56:58,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:58,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:58,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:58,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:58,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:58,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:59,603 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-13 21:56:59,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:56:59,604 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-13 21:56:59,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:59,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:59,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:56:59,672 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-13 21:56:59,673 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:59,685 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-13 21:56:59,690 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-13 21:56:59,690 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:59,700 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:59,713 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-13 21:56:59,714 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2019-01-13 21:56:59,930 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-13 21:56:59,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:56:59,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2019-01-13 21:56:59,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-13 21:56:59,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-13 21:56:59,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2019-01-13 21:56:59,953 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 20 states. [2019-01-13 21:57:01,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:01,228 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2019-01-13 21:57:01,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-13 21:57:01,229 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 24 [2019-01-13 21:57:01,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:01,231 INFO L225 Difference]: With dead ends: 57 [2019-01-13 21:57:01,231 INFO L226 Difference]: Without dead ends: 34 [2019-01-13 21:57:01,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=180, Invalid=1152, Unknown=0, NotChecked=0, Total=1332 [2019-01-13 21:57:01,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-13 21:57:01,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-01-13 21:57:01,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-13 21:57:01,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-01-13 21:57:01,240 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 24 [2019-01-13 21:57:01,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:01,240 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-01-13 21:57:01,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-13 21:57:01,240 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-01-13 21:57:01,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-13 21:57:01,241 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:01,241 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:57:01,241 INFO L423 AbstractCegarLoop]: === Iteration 17 === [cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-13 21:57:01,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:01,242 INFO L82 PathProgramCache]: Analyzing trace with hash 267592398, now seen corresponding path program 1 times [2019-01-13 21:57:01,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:01,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:01,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:01,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:01,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:01,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:02,101 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:02,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:57:02,103 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-13 21:57:02,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:02,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:02,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:57:02,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-13 21:57:02,257 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:02,267 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-13 21:57:02,271 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-13 21:57:02,272 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:02,276 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:02,286 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-13 21:57:02,287 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2019-01-13 21:57:02,773 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:02,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:57:02,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2019-01-13 21:57:02,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-13 21:57:02,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-13 21:57:02,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2019-01-13 21:57:02,794 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 20 states. [2019-01-13 21:57:04,476 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2019-01-13 21:57:04,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:04,542 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-01-13 21:57:04,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-13 21:57:04,543 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 26 [2019-01-13 21:57:04,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:04,556 INFO L225 Difference]: With dead ends: 38 [2019-01-13 21:57:04,556 INFO L226 Difference]: Without dead ends: 32 [2019-01-13 21:57:04,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=160, Invalid=1100, Unknown=0, NotChecked=0, Total=1260 [2019-01-13 21:57:04,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-13 21:57:04,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-01-13 21:57:04,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-13 21:57:04,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-01-13 21:57:04,559 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 26 [2019-01-13 21:57:04,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:04,559 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-01-13 21:57:04,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-13 21:57:04,560 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-01-13 21:57:04,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-13 21:57:04,560 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:04,560 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:57:04,561 INFO L423 AbstractCegarLoop]: === Iteration 18 === [cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-13 21:57:04,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:04,561 INFO L82 PathProgramCache]: Analyzing trace with hash -276531991, now seen corresponding path program 2 times [2019-01-13 21:57:04,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:04,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:04,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:04,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:04,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:04,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:05,092 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-13 21:57:05,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:57:05,092 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 21:57:05,102 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-13 21:57:05,130 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-13 21:57:05,130 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 21:57:05,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:57:05,153 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-13 21:57:05,154 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:05,164 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-13 21:57:05,170 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-13 21:57:05,170 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:05,174 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:05,182 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-13 21:57:05,182 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2019-01-13 21:57:05,207 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-13 21:57:05,209 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-13 21:57:05,209 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:05,212 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:05,220 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-13 21:57:05,221 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2019-01-13 21:57:05,473 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-13 21:57:05,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-13 21:57:05,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:05,488 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:05,501 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-13 21:57:05,502 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:22 [2019-01-13 21:57:05,665 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-13 21:57:05,680 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-13 21:57:05,681 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 21:57:05,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:57:05,724 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-13 21:57:05,724 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2019-01-13 21:57:05,879 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-13 21:57:05,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:57:05,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2019-01-13 21:57:05,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-13 21:57:05,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-13 21:57:05,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=499, Unknown=0, NotChecked=0, Total=552 [2019-01-13 21:57:05,900 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 24 states. [2019-01-13 21:57:07,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:07,288 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-01-13 21:57:07,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-13 21:57:07,289 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 27 [2019-01-13 21:57:07,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:07,290 INFO L225 Difference]: With dead ends: 30 [2019-01-13 21:57:07,290 INFO L226 Difference]: Without dead ends: 30 [2019-01-13 21:57:07,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=163, Invalid=1169, Unknown=0, NotChecked=0, Total=1332 [2019-01-13 21:57:07,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-13 21:57:07,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-01-13 21:57:07,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-13 21:57:07,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-01-13 21:57:07,293 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-01-13 21:57:07,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:07,294 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-01-13 21:57:07,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-13 21:57:07,294 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-01-13 21:57:07,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-13 21:57:07,295 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:07,297 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:57:07,298 INFO L423 AbstractCegarLoop]: === Iteration 19 === [cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-13 21:57:07,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:07,298 INFO L82 PathProgramCache]: Analyzing trace with hash 17442826, now seen corresponding path program 2 times [2019-01-13 21:57:07,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:07,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:07,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:07,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 21:57:07,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:07,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:07,588 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:07,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:57:07,589 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 21:57:07,599 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-13 21:57:07,628 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-13 21:57:07,628 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 21:57:07,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:57:07,652 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-13 21:57:07,652 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:07,666 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-13 21:57:07,673 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-13 21:57:07,674 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:07,683 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:07,691 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-13 21:57:07,692 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2019-01-13 21:57:07,993 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-13 21:57:08,119 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:08,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:57:08,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2019-01-13 21:57:08,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-13 21:57:08,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-13 21:57:08,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2019-01-13 21:57:08,144 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 22 states. [2019-01-13 21:57:09,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:09,225 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-01-13 21:57:09,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-13 21:57:09,227 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2019-01-13 21:57:09,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:09,227 INFO L225 Difference]: With dead ends: 35 [2019-01-13 21:57:09,227 INFO L226 Difference]: Without dead ends: 0 [2019-01-13 21:57:09,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=158, Invalid=1174, Unknown=0, NotChecked=0, Total=1332 [2019-01-13 21:57:09,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-13 21:57:09,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-13 21:57:09,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-13 21:57:09,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-13 21:57:09,229 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2019-01-13 21:57:09,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:09,229 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-13 21:57:09,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-13 21:57:09,230 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-13 21:57:09,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-13 21:57:09,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 09:57:09 BoogieIcfgContainer [2019-01-13 21:57:09,235 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 21:57:09,235 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 21:57:09,235 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 21:57:09,235 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 21:57:09,237 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 09:56:47" (3/4) ... [2019-01-13 21:57:09,240 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-13 21:57:09,247 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrncpy [2019-01-13 21:57:09,247 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-13 21:57:09,247 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-01-13 21:57:09,247 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-01-13 21:57:09,247 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-13 21:57:09,252 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2019-01-13 21:57:09,252 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-13 21:57:09,252 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-13 21:57:09,307 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 21:57:09,311 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 21:57:09,313 INFO L168 Benchmark]: Toolchain (without parser) took 22774.41 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 330.3 MB). Free memory was 947.3 MB in the beginning and 1.2 GB in the end (delta: -287.6 MB). Peak memory consumption was 42.7 MB. Max. memory is 11.5 GB. [2019-01-13 21:57:09,314 INFO L168 Benchmark]: CDTParser took 0.18 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-13 21:57:09,314 INFO L168 Benchmark]: CACSL2BoogieTranslator took 506.82 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 925.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-01-13 21:57:09,315 INFO L168 Benchmark]: Boogie Preprocessor took 133.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -205.5 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. [2019-01-13 21:57:09,315 INFO L168 Benchmark]: RCFGBuilder took 765.56 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: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. [2019-01-13 21:57:09,316 INFO L168 Benchmark]: TraceAbstraction took 21287.55 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 180.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -147.6 MB). Peak memory consumption was 33.3 MB. Max. memory is 11.5 GB. [2019-01-13 21:57:09,316 INFO L168 Benchmark]: Witness Printer took 76.22 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 21:57:09,326 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 506.82 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 925.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 133.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -205.5 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 765.56 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: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 21287.55 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 180.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -147.6 MB). Peak memory consumption was 33.3 MB. Max. memory is 11.5 GB. * Witness Printer took 76.22 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 556]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 46 locations, 9 error locations. SAFE Result, 21.2s OverallTime, 19 OverallIterations, 3 TraceHistogramMax, 10.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 455 SDtfs, 674 SDslu, 2190 SDs, 0 SdLazy, 2186 SolverSat, 169 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 401 GetRequests, 110 SyntacticMatches, 9 SemanticMatches, 282 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1041 ImplicationChecksByTransitivity, 13.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 60 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.6s InterpolantComputationTime, 516 NumberOfCodeBlocks, 516 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 491 ConstructedInterpolants, 21 QuantifiedInterpolants, 104553 SizeOfPredicates, 82 NumberOfNonLiveVariables, 988 ConjunctsInSsa, 290 ConjunctsInUnsatCore, 25 InterpolantComputations, 13 PerfectInterpolantSequences, 4/72 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...