./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/array-memsafety/openbsd_cbzero-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/array-memsafety/openbsd_cbzero-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 aa22a20876a8e4326d678ff2db099090fa4b56ec .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 17:13:07,660 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 17:13:07,662 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 17:13:07,674 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 17:13:07,675 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 17:13:07,676 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 17:13:07,678 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 17:13:07,680 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 17:13:07,682 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 17:13:07,683 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 17:13:07,684 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 17:13:07,685 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 17:13:07,686 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 17:13:07,687 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 17:13:07,689 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 17:13:07,689 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 17:13:07,690 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 17:13:07,693 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 17:13:07,695 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 17:13:07,697 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 17:13:07,698 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 17:13:07,700 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 17:13:07,703 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 17:13:07,703 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 17:13:07,703 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 17:13:07,704 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 17:13:07,706 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 17:13:07,707 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 17:13:07,708 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 17:13:07,709 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 17:13:07,710 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 17:13:07,710 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 17:13:07,711 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 17:13:07,711 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 17:13:07,713 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 17:13:07,714 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 17:13:07,714 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-01 17:13:07,738 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 17:13:07,742 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 17:13:07,743 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 17:13:07,743 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 17:13:07,744 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 17:13:07,744 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 17:13:07,744 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 17:13:07,744 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 17:13:07,744 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 17:13:07,747 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 17:13:07,747 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 17:13:07,747 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-01 17:13:07,747 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-01 17:13:07,748 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-01 17:13:07,748 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 17:13:07,748 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 17:13:07,748 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 17:13:07,748 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 17:13:07,749 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 17:13:07,749 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 17:13:07,749 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 17:13:07,749 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 17:13:07,750 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 17:13:07,753 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 17:13:07,754 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 17:13:07,754 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 17:13:07,754 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 -> aa22a20876a8e4326d678ff2db099090fa4b56ec [2019-01-01 17:13:07,789 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 17:13:07,808 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 17:13:07,815 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 17:13:07,817 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 17:13:07,817 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 17:13:07,818 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/openbsd_cbzero-alloca_true-valid-memsafety_true-termination.i [2019-01-01 17:13:07,889 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63f022936/55bc005236334527b38fa76365d0cc9b/FLAGb945bcee2 [2019-01-01 17:13:08,477 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 17:13:08,479 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/openbsd_cbzero-alloca_true-valid-memsafety_true-termination.i [2019-01-01 17:13:08,499 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63f022936/55bc005236334527b38fa76365d0cc9b/FLAGb945bcee2 [2019-01-01 17:13:08,696 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63f022936/55bc005236334527b38fa76365d0cc9b [2019-01-01 17:13:08,699 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 17:13:08,700 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-01 17:13:08,702 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 17:13:08,702 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 17:13:08,706 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 17:13:08,708 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 05:13:08" (1/1) ... [2019-01-01 17:13:08,711 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5255592d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:08, skipping insertion in model container [2019-01-01 17:13:08,711 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 05:13:08" (1/1) ... [2019-01-01 17:13:08,719 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 17:13:08,773 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 17:13:09,047 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 17:13:09,062 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 17:13:09,141 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 17:13:09,204 INFO L195 MainTranslator]: Completed translation [2019-01-01 17:13:09,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:09 WrapperNode [2019-01-01 17:13:09,205 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 17:13:09,206 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 17:13:09,206 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 17:13:09,206 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 17:13:09,294 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:09" (1/1) ... [2019-01-01 17:13:09,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:09" (1/1) ... [2019-01-01 17:13:09,309 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:09" (1/1) ... [2019-01-01 17:13:09,309 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:09" (1/1) ... [2019-01-01 17:13:09,322 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:09" (1/1) ... [2019-01-01 17:13:09,327 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:09" (1/1) ... [2019-01-01 17:13:09,329 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:09" (1/1) ... [2019-01-01 17:13:09,335 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 17:13:09,336 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 17:13:09,336 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 17:13:09,336 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 17:13:09,337 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 17:13:09,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-01 17:13:09,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 17:13:09,410 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-01 17:13:09,410 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-01 17:13:09,410 INFO L138 BoogieDeclarations]: Found implementation of procedure cbzero [2019-01-01 17:13:09,410 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-01 17:13:09,410 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-01 17:13:09,411 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-01 17:13:09,411 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-01 17:13:09,411 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-01 17:13:09,411 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-01 17:13:09,411 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-01 17:13:09,412 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-01 17:13:09,412 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-01 17:13:09,412 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-01 17:13:09,412 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-01 17:13:09,412 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-01 17:13:09,412 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-01 17:13:09,413 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-01 17:13:09,413 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-01 17:13:09,413 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-01 17:13:09,413 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-01 17:13:09,413 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-01 17:13:09,413 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-01 17:13:09,414 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-01 17:13:09,414 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-01 17:13:09,414 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-01 17:13:09,414 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-01 17:13:09,414 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-01 17:13:09,414 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-01 17:13:09,415 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-01 17:13:09,415 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-01 17:13:09,415 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-01 17:13:09,415 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-01 17:13:09,415 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-01 17:13:09,415 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-01 17:13:09,415 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-01 17:13:09,416 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-01 17:13:09,416 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-01 17:13:09,416 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-01 17:13:09,416 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-01 17:13:09,416 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-01 17:13:09,416 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-01 17:13:09,417 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-01 17:13:09,417 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-01 17:13:09,417 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-01 17:13:09,417 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-01 17:13:09,417 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-01 17:13:09,417 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-01 17:13:09,417 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-01 17:13:09,418 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-01 17:13:09,418 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-01 17:13:09,418 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-01 17:13:09,418 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-01 17:13:09,418 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-01 17:13:09,418 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-01 17:13:09,418 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-01 17:13:09,418 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-01 17:13:09,419 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-01 17:13:09,419 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-01 17:13:09,419 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-01 17:13:09,419 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-01 17:13:09,419 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-01 17:13:09,419 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-01 17:13:09,419 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-01 17:13:09,419 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-01 17:13:09,420 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-01 17:13:09,420 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-01 17:13:09,420 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-01 17:13:09,420 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-01 17:13:09,420 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-01 17:13:09,420 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-01 17:13:09,420 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-01 17:13:09,421 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-01 17:13:09,421 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-01 17:13:09,421 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-01 17:13:09,421 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-01 17:13:09,421 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-01 17:13:09,421 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-01 17:13:09,421 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-01 17:13:09,422 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-01 17:13:09,422 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-01 17:13:09,422 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-01 17:13:09,422 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-01 17:13:09,422 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-01 17:13:09,422 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-01 17:13:09,422 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-01 17:13:09,423 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-01 17:13:09,423 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-01 17:13:09,423 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-01 17:13:09,423 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-01 17:13:09,423 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-01 17:13:09,423 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-01 17:13:09,423 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-01 17:13:09,423 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-01 17:13:09,424 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-01 17:13:09,424 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-01 17:13:09,424 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-01 17:13:09,424 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-01 17:13:09,424 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-01 17:13:09,424 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-01 17:13:09,424 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-01 17:13:09,424 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-01 17:13:09,425 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-01 17:13:09,425 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-01 17:13:09,425 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-01 17:13:09,425 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-01 17:13:09,425 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-01 17:13:09,425 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-01 17:13:09,425 INFO L130 BoogieDeclarations]: Found specification of procedure cbzero [2019-01-01 17:13:09,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 17:13:09,426 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-01 17:13:09,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 17:13:09,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 17:13:09,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-01 17:13:09,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 17:13:09,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 17:13:10,014 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 17:13:10,014 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2019-01-01 17:13:10,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:13:10 BoogieIcfgContainer [2019-01-01 17:13:10,015 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 17:13:10,017 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 17:13:10,017 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 17:13:10,021 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 17:13:10,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 05:13:08" (1/3) ... [2019-01-01 17:13:10,022 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29fd52e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 05:13:10, skipping insertion in model container [2019-01-01 17:13:10,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:09" (2/3) ... [2019-01-01 17:13:10,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29fd52e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 05:13:10, skipping insertion in model container [2019-01-01 17:13:10,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:13:10" (3/3) ... [2019-01-01 17:13:10,026 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cbzero-alloca_true-valid-memsafety_true-termination.i [2019-01-01 17:13:10,037 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 17:13:10,046 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-01 17:13:10,066 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-01 17:13:10,095 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 17:13:10,096 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 17:13:10,096 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-01 17:13:10,097 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 17:13:10,097 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 17:13:10,097 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 17:13:10,098 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 17:13:10,098 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 17:13:10,098 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 17:13:10,119 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-01-01 17:13:10,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-01 17:13:10,137 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:10,139 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:10,142 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cbzeroErr0REQUIRES_VIOLATION, cbzeroErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-01 17:13:10,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:10,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1895989102, now seen corresponding path program 1 times [2019-01-01 17:13:10,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:10,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:10,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:10,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:10,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:10,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:10,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:10,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:10,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 17:13:10,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 17:13:10,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 17:13:10,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:13:10,369 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 4 states. [2019-01-01 17:13:10,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:10,507 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2019-01-01 17:13:10,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 17:13:10,510 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-01 17:13:10,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:10,521 INFO L225 Difference]: With dead ends: 29 [2019-01-01 17:13:10,521 INFO L226 Difference]: Without dead ends: 25 [2019-01-01 17:13:10,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-01 17:13:10,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-01 17:13:10,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2019-01-01 17:13:10,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-01 17:13:10,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2019-01-01 17:13:10,564 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 10 [2019-01-01 17:13:10,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:10,564 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-01-01 17:13:10,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 17:13:10,565 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2019-01-01 17:13:10,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-01 17:13:10,566 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:10,566 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:10,566 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cbzeroErr0REQUIRES_VIOLATION, cbzeroErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-01 17:13:10,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:10,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1895991024, now seen corresponding path program 1 times [2019-01-01 17:13:10,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:10,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:10,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:10,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:10,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:10,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:10,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:10,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:10,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 17:13:10,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 17:13:10,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 17:13:10,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 17:13:10,630 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 3 states. [2019-01-01 17:13:10,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:10,699 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2019-01-01 17:13:10,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 17:13:10,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-01 17:13:10,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:10,701 INFO L225 Difference]: With dead ends: 24 [2019-01-01 17:13:10,701 INFO L226 Difference]: Without dead ends: 23 [2019-01-01 17:13:10,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 17:13:10,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-01 17:13:10,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-01-01 17:13:10,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-01 17:13:10,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-01-01 17:13:10,706 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 10 [2019-01-01 17:13:10,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:10,707 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-01-01 17:13:10,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 17:13:10,707 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-01-01 17:13:10,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-01 17:13:10,708 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:10,708 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:10,708 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cbzeroErr0REQUIRES_VIOLATION, cbzeroErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-01 17:13:10,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:10,709 INFO L82 PathProgramCache]: Analyzing trace with hash 633507385, now seen corresponding path program 1 times [2019-01-01 17:13:10,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:10,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:10,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:10,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:10,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:10,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:10,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:10,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:10,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 17:13:10,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 17:13:10,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 17:13:10,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:13:10,886 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 6 states. [2019-01-01 17:13:11,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:11,114 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2019-01-01 17:13:11,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 17:13:11,115 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-01-01 17:13:11,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:11,117 INFO L225 Difference]: With dead ends: 21 [2019-01-01 17:13:11,117 INFO L226 Difference]: Without dead ends: 21 [2019-01-01 17:13:11,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-01 17:13:11,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-01 17:13:11,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-01-01 17:13:11,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-01 17:13:11,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-01-01 17:13:11,121 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 14 [2019-01-01 17:13:11,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:11,122 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-01-01 17:13:11,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 17:13:11,122 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-01-01 17:13:11,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-01 17:13:11,123 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:11,123 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:11,123 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cbzeroErr0REQUIRES_VIOLATION, cbzeroErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-01 17:13:11,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:11,124 INFO L82 PathProgramCache]: Analyzing trace with hash 633507386, now seen corresponding path program 1 times [2019-01-01 17:13:11,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:11,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:11,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:11,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:11,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:11,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:11,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:11,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:11,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 17:13:11,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 17:13:11,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 17:13:11,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-01 17:13:11,310 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 7 states. [2019-01-01 17:13:11,641 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-01 17:13:11,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:11,770 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2019-01-01 17:13:11,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 17:13:11,771 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-01-01 17:13:11,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:11,773 INFO L225 Difference]: With dead ends: 27 [2019-01-01 17:13:11,774 INFO L226 Difference]: Without dead ends: 27 [2019-01-01 17:13:11,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-01-01 17:13:11,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-01 17:13:11,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2019-01-01 17:13:11,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-01 17:13:11,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2019-01-01 17:13:11,780 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 14 [2019-01-01 17:13:11,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:11,781 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-01-01 17:13:11,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 17:13:11,781 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2019-01-01 17:13:11,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-01 17:13:11,782 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:11,782 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:11,782 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cbzeroErr0REQUIRES_VIOLATION, cbzeroErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-01 17:13:11,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:11,782 INFO L82 PathProgramCache]: Analyzing trace with hash 730618770, now seen corresponding path program 1 times [2019-01-01 17:13:11,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:11,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:11,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:11,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:11,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:11,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:11,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:11,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:11,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 17:13:11,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 17:13:11,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 17:13:11,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:13:11,972 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 6 states. [2019-01-01 17:13:12,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:12,030 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-01-01 17:13:12,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 17:13:12,032 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-01-01 17:13:12,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:12,034 INFO L225 Difference]: With dead ends: 31 [2019-01-01 17:13:12,035 INFO L226 Difference]: Without dead ends: 31 [2019-01-01 17:13:12,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:13:12,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-01 17:13:12,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2019-01-01 17:13:12,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-01 17:13:12,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-01-01 17:13:12,045 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 17 [2019-01-01 17:13:12,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:12,046 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-01-01 17:13:12,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 17:13:12,046 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-01-01 17:13:12,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-01 17:13:12,047 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:12,047 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:12,047 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cbzeroErr0REQUIRES_VIOLATION, cbzeroErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-01 17:13:12,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:12,047 INFO L82 PathProgramCache]: Analyzing trace with hash 337591760, now seen corresponding path program 1 times [2019-01-01 17:13:12,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:12,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:12,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:12,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:12,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:12,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:12,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:12,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:12,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 17:13:12,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 17:13:12,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 17:13:12,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:13:12,167 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 4 states. [2019-01-01 17:13:12,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:12,260 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2019-01-01 17:13:12,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 17:13:12,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-01-01 17:13:12,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:12,264 INFO L225 Difference]: With dead ends: 27 [2019-01-01 17:13:12,264 INFO L226 Difference]: Without dead ends: 21 [2019-01-01 17:13:12,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:13:12,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-01 17:13:12,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2019-01-01 17:13:12,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-01 17:13:12,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-01-01 17:13:12,270 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 17 [2019-01-01 17:13:12,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:12,271 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-01-01 17:13:12,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 17:13:12,271 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2019-01-01 17:13:12,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-01 17:13:12,271 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:12,272 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:12,272 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cbzeroErr0REQUIRES_VIOLATION, cbzeroErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-01 17:13:12,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:12,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1223076658, now seen corresponding path program 1 times [2019-01-01 17:13:12,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:12,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:12,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:12,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:12,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:12,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:12,450 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:12,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:13:12,451 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 17:13:12,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:12,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:12,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:13:12,718 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:12,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:13:12,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-01-01 17:13:12,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 17:13:12,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 17:13:12,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-01 17:13:12,746 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 8 states. [2019-01-01 17:13:13,027 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-01 17:13:13,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:13,028 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2019-01-01 17:13:13,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 17:13:13,029 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-01-01 17:13:13,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:13,029 INFO L225 Difference]: With dead ends: 28 [2019-01-01 17:13:13,029 INFO L226 Difference]: Without dead ends: 19 [2019-01-01 17:13:13,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-01-01 17:13:13,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-01 17:13:13,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-01-01 17:13:13,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-01 17:13:13,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-01-01 17:13:13,033 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 18 [2019-01-01 17:13:13,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:13,033 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-01-01 17:13:13,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 17:13:13,033 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-01-01 17:13:13,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-01 17:13:13,034 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:13,034 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:13,035 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cbzeroErr0REQUIRES_VIOLATION, cbzeroErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-01 17:13:13,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:13,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1924141236, now seen corresponding path program 1 times [2019-01-01 17:13:13,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:13,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:13,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:13,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:13,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:13,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:13,309 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:13,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:13:13,310 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 17:13:13,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:13,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:13,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:13:13,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:13,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:13:13,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-01-01 17:13:13,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-01 17:13:13,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 17:13:13,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-01-01 17:13:13,460 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 10 states. [2019-01-01 17:13:13,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:13,561 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-01-01 17:13:13,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 17:13:13,561 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-01-01 17:13:13,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:13,563 INFO L225 Difference]: With dead ends: 29 [2019-01-01 17:13:13,563 INFO L226 Difference]: Without dead ends: 19 [2019-01-01 17:13:13,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-01-01 17:13:13,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-01 17:13:13,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-01-01 17:13:13,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-01 17:13:13,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-01-01 17:13:13,566 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 18 [2019-01-01 17:13:13,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:13,566 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-01-01 17:13:13,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-01 17:13:13,567 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-01-01 17:13:13,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-01 17:13:13,567 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:13,567 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:13,568 INFO L423 AbstractCegarLoop]: === Iteration 9 === [cbzeroErr0REQUIRES_VIOLATION, cbzeroErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-01 17:13:13,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:13,568 INFO L82 PathProgramCache]: Analyzing trace with hash -2112660622, now seen corresponding path program 1 times [2019-01-01 17:13:13,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:13,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:13,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:13,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:13,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:13,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:13,888 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:13,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:13:13,889 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 17:13:13,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:13,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:13,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:13:13,948 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 6 treesize of output 5 [2019-01-01 17:13:13,951 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:13,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:13,964 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:12 [2019-01-01 17:13:14,241 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:14,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:13:14,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-01-01 17:13:14,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-01 17:13:14,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-01 17:13:14,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2019-01-01 17:13:14,261 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 19 states. [2019-01-01 17:13:14,562 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 23 [2019-01-01 17:13:14,727 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-01-01 17:13:14,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:14,823 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-01-01 17:13:14,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 17:13:14,824 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2019-01-01 17:13:14,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:14,826 INFO L225 Difference]: With dead ends: 24 [2019-01-01 17:13:14,826 INFO L226 Difference]: Without dead ends: 24 [2019-01-01 17:13:14,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2019-01-01 17:13:14,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-01 17:13:14,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-01-01 17:13:14,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-01 17:13:14,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-01-01 17:13:14,832 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 18 [2019-01-01 17:13:14,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:14,833 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-01-01 17:13:14,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-01 17:13:14,833 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-01-01 17:13:14,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-01 17:13:14,833 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:14,835 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:14,835 INFO L423 AbstractCegarLoop]: === Iteration 10 === [cbzeroErr0REQUIRES_VIOLATION, cbzeroErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-01 17:13:14,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:14,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1226710122, now seen corresponding path program 2 times [2019-01-01 17:13:14,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:14,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:14,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:14,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:14,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:14,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:15,333 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:15,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:13:15,333 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 17:13:15,344 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 17:13:15,365 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 17:13:15,365 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 17:13:15,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:13:15,392 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 6 treesize of output 5 [2019-01-01 17:13:15,392 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:15,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:15,476 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:12 [2019-01-01 17:13:15,883 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:15,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:13:15,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2019-01-01 17:13:15,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-01 17:13:15,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-01 17:13:15,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2019-01-01 17:13:15,903 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 24 states. [2019-01-01 17:13:16,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:16,936 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-01-01 17:13:16,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-01 17:13:16,937 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 22 [2019-01-01 17:13:16,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:16,937 INFO L225 Difference]: With dead ends: 27 [2019-01-01 17:13:16,937 INFO L226 Difference]: Without dead ends: 0 [2019-01-01 17:13:16,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=150, Invalid=1110, Unknown=0, NotChecked=0, Total=1260 [2019-01-01 17:13:16,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-01 17:13:16,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-01 17:13:16,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-01 17:13:16,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 17:13:16,939 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-01-01 17:13:16,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:16,939 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 17:13:16,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-01 17:13:16,940 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-01 17:13:16,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-01 17:13:16,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 05:13:16 BoogieIcfgContainer [2019-01-01 17:13:16,948 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 17:13:16,949 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 17:13:16,949 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 17:13:16,949 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 17:13:16,949 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:13:10" (3/4) ... [2019-01-01 17:13:16,955 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-01 17:13:16,962 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-01 17:13:16,963 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-01-01 17:13:16,963 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-01-01 17:13:16,963 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cbzero [2019-01-01 17:13:16,963 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-01 17:13:16,967 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2019-01-01 17:13:16,967 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-01 17:13:16,967 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-01 17:13:17,024 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 17:13:17,024 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 17:13:17,025 INFO L168 Benchmark]: Toolchain (without parser) took 8325.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 201.3 MB). Free memory was 952.7 MB in the beginning and 1.0 GB in the end (delta: -51.4 MB). Peak memory consumption was 149.9 MB. Max. memory is 11.5 GB. [2019-01-01 17:13:17,026 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 17:13:17,026 INFO L168 Benchmark]: CACSL2BoogieTranslator took 503.93 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 929.9 MB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-01-01 17:13:17,027 INFO L168 Benchmark]: Boogie Preprocessor took 129.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -188.7 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2019-01-01 17:13:17,027 INFO L168 Benchmark]: RCFGBuilder took 679.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.0 MB). Peak memory consumption was 39.0 MB. Max. memory is 11.5 GB. [2019-01-01 17:13:17,028 INFO L168 Benchmark]: TraceAbstraction took 6931.52 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 69.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 74.4 MB). Peak memory consumption was 143.6 MB. Max. memory is 11.5 GB. [2019-01-01 17:13:17,029 INFO L168 Benchmark]: Witness Printer took 75.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 11.5 GB. [2019-01-01 17:13:17,032 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 503.93 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 929.9 MB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 129.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -188.7 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 679.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.0 MB). Peak memory consumption was 39.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6931.52 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 69.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 74.4 MB). Peak memory consumption was 143.6 MB. Max. memory is 11.5 GB. * Witness Printer took 75.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 31 locations, 3 error locations. SAFE Result, 6.8s OverallTime, 10 OverallIterations, 3 TraceHistogramMax, 3.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 174 SDtfs, 126 SDslu, 630 SDs, 0 SdLazy, 465 SolverSat, 48 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 169 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 12 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 234 NumberOfCodeBlocks, 234 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 220 ConstructedInterpolants, 2 QuantifiedInterpolants, 24381 SizeOfPredicates, 30 NumberOfNonLiveVariables, 429 ConjunctsInSsa, 122 ConjunctsInUnsatCore, 14 InterpolantComputations, 6 PerfectInterpolantSequences, 4/38 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...