./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/array-memsafety/strreplace-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/strreplace-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 04214bcb8e1f50bae63b15c1fa309fb3edc667ba ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:14:27,647 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 17:14:27,648 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 17:14:27,665 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 17:14:27,666 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 17:14:27,666 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 17:14:27,668 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 17:14:27,669 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 17:14:27,671 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 17:14:27,672 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 17:14:27,673 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 17:14:27,673 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 17:14:27,674 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 17:14:27,675 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 17:14:27,676 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 17:14:27,677 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 17:14:27,678 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 17:14:27,679 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 17:14:27,681 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 17:14:27,683 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 17:14:27,684 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 17:14:27,685 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 17:14:27,688 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 17:14:27,688 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 17:14:27,689 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 17:14:27,689 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 17:14:27,691 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 17:14:27,691 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 17:14:27,692 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 17:14:27,693 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 17:14:27,694 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 17:14:27,694 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 17:14:27,695 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 17:14:27,695 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 17:14:27,696 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 17:14:27,699 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 17:14:27,699 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:14:27,731 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 17:14:27,731 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 17:14:27,736 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 17:14:27,736 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 17:14:27,737 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 17:14:27,737 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 17:14:27,737 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 17:14:27,737 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 17:14:27,738 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 17:14:27,738 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 17:14:27,738 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 17:14:27,738 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-01 17:14:27,738 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-01 17:14:27,738 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-01 17:14:27,739 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 17:14:27,739 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 17:14:27,739 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 17:14:27,739 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 17:14:27,739 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 17:14:27,739 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 17:14:27,741 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 17:14:27,741 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 17:14:27,741 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 17:14:27,742 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 17:14:27,742 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 17:14:27,742 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 17:14:27,742 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 -> 04214bcb8e1f50bae63b15c1fa309fb3edc667ba [2019-01-01 17:14:27,803 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 17:14:27,823 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 17:14:27,830 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 17:14:27,831 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 17:14:27,832 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 17:14:27,832 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/strreplace-alloca_true-valid-memsafety_true-termination.i [2019-01-01 17:14:27,900 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e47838676/6dad29d8a6ef4186af9ea556257037ed/FLAG8b4bde32d [2019-01-01 17:14:28,454 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 17:14:28,455 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/strreplace-alloca_true-valid-memsafety_true-termination.i [2019-01-01 17:14:28,468 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e47838676/6dad29d8a6ef4186af9ea556257037ed/FLAG8b4bde32d [2019-01-01 17:14:28,753 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e47838676/6dad29d8a6ef4186af9ea556257037ed [2019-01-01 17:14:28,757 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 17:14:28,758 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-01 17:14:28,759 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 17:14:28,760 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 17:14:28,763 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 17:14:28,764 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 05:14:28" (1/1) ... [2019-01-01 17:14:28,767 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54e3e636 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:14:28, skipping insertion in model container [2019-01-01 17:14:28,767 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 05:14:28" (1/1) ... [2019-01-01 17:14:28,775 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 17:14:28,821 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 17:14:29,179 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 17:14:29,191 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 17:14:29,331 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 17:14:29,391 INFO L195 MainTranslator]: Completed translation [2019-01-01 17:14:29,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:14:29 WrapperNode [2019-01-01 17:14:29,392 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 17:14:29,393 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 17:14:29,393 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 17:14:29,393 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 17:14:29,408 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:14:29" (1/1) ... [2019-01-01 17:14:29,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:14:29" (1/1) ... [2019-01-01 17:14:29,427 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:14:29" (1/1) ... [2019-01-01 17:14:29,428 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:14:29" (1/1) ... [2019-01-01 17:14:29,442 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:14:29" (1/1) ... [2019-01-01 17:14:29,446 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:14:29" (1/1) ... [2019-01-01 17:14:29,449 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:14:29" (1/1) ... [2019-01-01 17:14:29,454 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 17:14:29,455 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 17:14:29,455 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 17:14:29,455 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 17:14:29,456 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:14:29" (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:14:29,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-01 17:14:29,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 17:14:29,518 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-01 17:14:29,518 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-01 17:14:29,518 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrreplace [2019-01-01 17:14:29,519 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-01 17:14:29,519 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-01 17:14:29,519 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-01 17:14:29,519 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-01 17:14:29,519 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-01 17:14:29,519 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-01 17:14:29,520 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-01 17:14:29,520 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-01 17:14:29,520 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-01 17:14:29,520 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-01 17:14:29,520 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-01 17:14:29,520 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-01 17:14:29,522 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-01 17:14:29,522 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-01 17:14:29,523 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-01 17:14:29,523 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-01 17:14:29,523 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-01 17:14:29,523 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-01 17:14:29,524 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-01 17:14:29,524 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-01 17:14:29,524 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-01 17:14:29,524 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-01 17:14:29,524 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-01 17:14:29,524 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-01 17:14:29,525 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-01 17:14:29,525 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-01 17:14:29,525 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-01 17:14:29,525 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-01 17:14:29,525 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-01 17:14:29,525 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-01 17:14:29,526 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-01 17:14:29,527 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-01 17:14:29,528 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-01 17:14:29,528 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-01 17:14:29,528 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-01 17:14:29,528 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-01 17:14:29,528 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-01 17:14:29,529 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-01 17:14:29,529 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-01 17:14:29,529 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-01 17:14:29,529 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-01 17:14:29,529 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-01 17:14:29,529 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-01 17:14:29,529 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-01 17:14:29,530 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-01 17:14:29,530 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-01 17:14:29,530 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-01 17:14:29,530 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-01 17:14:29,530 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-01 17:14:29,530 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-01 17:14:29,530 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-01 17:14:29,532 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-01 17:14:29,533 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-01 17:14:29,533 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-01 17:14:29,533 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-01 17:14:29,533 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-01 17:14:29,533 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-01 17:14:29,533 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-01 17:14:29,533 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-01 17:14:29,534 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-01 17:14:29,535 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-01 17:14:29,535 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-01 17:14:29,535 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-01 17:14:29,535 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-01 17:14:29,535 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-01 17:14:29,535 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-01 17:14:29,535 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-01 17:14:29,535 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-01 17:14:29,535 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-01 17:14:29,536 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-01 17:14:29,536 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-01 17:14:29,536 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-01 17:14:29,536 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-01 17:14:29,536 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-01 17:14:29,536 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-01 17:14:29,536 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-01 17:14:29,538 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-01 17:14:29,538 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-01 17:14:29,538 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-01 17:14:29,539 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-01 17:14:29,539 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-01 17:14:29,539 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-01 17:14:29,539 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-01 17:14:29,539 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-01 17:14:29,539 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-01 17:14:29,539 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-01 17:14:29,539 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-01 17:14:29,541 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-01 17:14:29,541 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-01 17:14:29,541 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-01 17:14:29,541 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-01 17:14:29,541 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-01 17:14:29,541 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-01 17:14:29,541 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-01 17:14:29,542 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-01 17:14:29,542 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-01 17:14:29,542 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-01 17:14:29,542 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-01 17:14:29,542 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-01 17:14:29,542 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-01 17:14:29,542 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-01 17:14:29,542 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-01 17:14:29,543 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-01 17:14:29,544 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-01 17:14:29,544 INFO L130 BoogieDeclarations]: Found specification of procedure cstrreplace [2019-01-01 17:14:29,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 17:14:29,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 17:14:29,545 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-01 17:14:29,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 17:14:29,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 17:14:29,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-01 17:14:29,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 17:14:30,231 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 17:14:30,232 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2019-01-01 17:14:30,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:14:30 BoogieIcfgContainer [2019-01-01 17:14:30,232 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 17:14:30,233 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 17:14:30,233 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 17:14:30,237 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 17:14:30,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 05:14:28" (1/3) ... [2019-01-01 17:14:30,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25b581c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 05:14:30, skipping insertion in model container [2019-01-01 17:14:30,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:14:29" (2/3) ... [2019-01-01 17:14:30,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25b581c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 05:14:30, skipping insertion in model container [2019-01-01 17:14:30,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:14:30" (3/3) ... [2019-01-01 17:14:30,240 INFO L112 eAbstractionObserver]: Analyzing ICFG strreplace-alloca_true-valid-memsafety_true-termination.i [2019-01-01 17:14:30,251 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 17:14:30,260 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2019-01-01 17:14:30,279 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2019-01-01 17:14:30,307 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 17:14:30,308 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 17:14:30,308 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-01 17:14:30,308 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 17:14:30,309 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 17:14:30,309 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 17:14:30,309 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 17:14:30,309 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 17:14:30,309 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 17:14:30,326 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2019-01-01 17:14:30,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-01 17:14:30,336 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:14:30,337 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:14:30,340 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrreplaceErr3REQUIRES_VIOLATION, cstrreplaceErr4REQUIRES_VIOLATION, cstrreplaceErr5REQUIRES_VIOLATION, cstrreplaceErr0REQUIRES_VIOLATION, cstrreplaceErr2REQUIRES_VIOLATION, cstrreplaceErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-01 17:14:30,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:14:30,345 INFO L82 PathProgramCache]: Analyzing trace with hash -129737215, now seen corresponding path program 1 times [2019-01-01 17:14:30,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:14:30,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:14:30,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:30,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:14:30,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:30,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:14:30,540 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:14:30,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:14:30,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 17:14:30,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 17:14:30,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 17:14:30,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 17:14:30,562 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 3 states. [2019-01-01 17:14:30,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:14:30,660 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2019-01-01 17:14:30,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 17:14:30,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-01-01 17:14:30,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:14:30,675 INFO L225 Difference]: With dead ends: 35 [2019-01-01 17:14:30,676 INFO L226 Difference]: Without dead ends: 32 [2019-01-01 17:14:30,678 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:14:30,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-01 17:14:30,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-01-01 17:14:30,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-01 17:14:30,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2019-01-01 17:14:30,723 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 9 [2019-01-01 17:14:30,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:14:30,723 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2019-01-01 17:14:30,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 17:14:30,724 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2019-01-01 17:14:30,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-01 17:14:30,724 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:14:30,724 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:14:30,726 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrreplaceErr3REQUIRES_VIOLATION, cstrreplaceErr4REQUIRES_VIOLATION, cstrreplaceErr5REQUIRES_VIOLATION, cstrreplaceErr0REQUIRES_VIOLATION, cstrreplaceErr2REQUIRES_VIOLATION, cstrreplaceErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-01 17:14:30,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:14:30,726 INFO L82 PathProgramCache]: Analyzing trace with hash -129737214, now seen corresponding path program 1 times [2019-01-01 17:14:30,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:14:30,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:14:30,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:30,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:14:30,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:30,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:14:31,053 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2019-01-01 17:14:31,054 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:14:31,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:14:31,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 17:14:31,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 17:14:31,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 17:14:31,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:14:31,058 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 4 states. [2019-01-01 17:14:31,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:14:31,166 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2019-01-01 17:14:31,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 17:14:31,167 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-01-01 17:14:31,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:14:31,168 INFO L225 Difference]: With dead ends: 31 [2019-01-01 17:14:31,168 INFO L226 Difference]: Without dead ends: 31 [2019-01-01 17:14:31,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:14:31,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-01 17:14:31,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-01-01 17:14:31,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-01 17:14:31,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-01-01 17:14:31,174 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 9 [2019-01-01 17:14:31,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:14:31,175 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-01-01 17:14:31,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 17:14:31,175 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2019-01-01 17:14:31,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-01 17:14:31,176 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:14:31,176 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:14:31,176 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrreplaceErr3REQUIRES_VIOLATION, cstrreplaceErr4REQUIRES_VIOLATION, cstrreplaceErr5REQUIRES_VIOLATION, cstrreplaceErr0REQUIRES_VIOLATION, cstrreplaceErr2REQUIRES_VIOLATION, cstrreplaceErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-01 17:14:31,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:14:31,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1659701328, now seen corresponding path program 1 times [2019-01-01 17:14:31,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:14:31,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:14:31,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:31,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:14:31,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:31,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:14:31,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:14:31,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:14:31,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 17:14:31,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 17:14:31,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 17:14:31,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 17:14:31,293 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 5 states. [2019-01-01 17:14:31,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:14:31,604 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2019-01-01 17:14:31,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 17:14:31,604 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-01-01 17:14:31,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:14:31,605 INFO L225 Difference]: With dead ends: 28 [2019-01-01 17:14:31,605 INFO L226 Difference]: Without dead ends: 28 [2019-01-01 17:14:31,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:14:31,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-01 17:14:31,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-01-01 17:14:31,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-01 17:14:31,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-01-01 17:14:31,612 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 13 [2019-01-01 17:14:31,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:14:31,612 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-01-01 17:14:31,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 17:14:31,612 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-01-01 17:14:31,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-01 17:14:31,613 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:14:31,613 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:14:31,613 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrreplaceErr3REQUIRES_VIOLATION, cstrreplaceErr4REQUIRES_VIOLATION, cstrreplaceErr5REQUIRES_VIOLATION, cstrreplaceErr0REQUIRES_VIOLATION, cstrreplaceErr2REQUIRES_VIOLATION, cstrreplaceErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-01 17:14:31,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:14:31,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1659701329, now seen corresponding path program 1 times [2019-01-01 17:14:31,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:14:31,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:14:31,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:31,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:14:31,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:31,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:14:31,772 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:14:31,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:14:31,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 17:14:31,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 17:14:31,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 17:14:31,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-01 17:14:31,775 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 7 states. [2019-01-01 17:14:32,034 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-01 17:14:32,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:14:32,227 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2019-01-01 17:14:32,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 17:14:32,228 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-01-01 17:14:32,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:14:32,231 INFO L225 Difference]: With dead ends: 38 [2019-01-01 17:14:32,231 INFO L226 Difference]: Without dead ends: 38 [2019-01-01 17:14:32,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-01 17:14:32,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-01 17:14:32,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 33. [2019-01-01 17:14:32,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-01 17:14:32,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-01-01 17:14:32,238 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 13 [2019-01-01 17:14:32,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:14:32,238 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-01-01 17:14:32,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 17:14:32,238 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-01-01 17:14:32,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-01 17:14:32,239 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:14:32,239 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-01 17:14:32,240 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrreplaceErr3REQUIRES_VIOLATION, cstrreplaceErr4REQUIRES_VIOLATION, cstrreplaceErr5REQUIRES_VIOLATION, cstrreplaceErr0REQUIRES_VIOLATION, cstrreplaceErr2REQUIRES_VIOLATION, cstrreplaceErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-01 17:14:32,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:14:32,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1732867125, now seen corresponding path program 1 times [2019-01-01 17:14:32,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:14:32,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:14:32,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:32,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:14:32,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:32,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:14:32,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:14:32,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:14:32,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-01 17:14:32,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 17:14:32,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 17:14:32,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-01 17:14:32,523 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 8 states. [2019-01-01 17:14:32,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:14:32,704 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-01-01 17:14:32,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 17:14:32,705 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-01-01 17:14:32,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:14:32,707 INFO L225 Difference]: With dead ends: 46 [2019-01-01 17:14:32,708 INFO L226 Difference]: Without dead ends: 46 [2019-01-01 17:14:32,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-01-01 17:14:32,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-01 17:14:32,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2019-01-01 17:14:32,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-01 17:14:32,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-01-01 17:14:32,715 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 18 [2019-01-01 17:14:32,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:14:32,716 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-01-01 17:14:32,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 17:14:32,716 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-01-01 17:14:32,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-01 17:14:32,717 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:14:32,717 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-01 17:14:32,717 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrreplaceErr3REQUIRES_VIOLATION, cstrreplaceErr4REQUIRES_VIOLATION, cstrreplaceErr5REQUIRES_VIOLATION, cstrreplaceErr0REQUIRES_VIOLATION, cstrreplaceErr2REQUIRES_VIOLATION, cstrreplaceErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-01 17:14:32,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:14:32,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1474701687, now seen corresponding path program 1 times [2019-01-01 17:14:32,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:14:32,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:14:32,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:32,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:14:32,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:32,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:14:33,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:14:33,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:14:33,057 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:14:33,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:14:33,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:14:33,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:14:33,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-01 17:14:33,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2019-01-01 17:14:33,176 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:14:33,181 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:14:33,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:14:33,194 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-01-01 17:14:33,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2019-01-01 17:14:33,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2019-01-01 17:14:33,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 17:14:33,486 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:14:33,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:14:33,512 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2019-01-01 17:14:33,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:14:33,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:14:33,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2019-01-01 17:14:33,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-01 17:14:33,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-01 17:14:33,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-01-01 17:14:33,705 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 15 states. [2019-01-01 17:14:37,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:14:37,302 INFO L93 Difference]: Finished difference Result 98 states and 108 transitions. [2019-01-01 17:14:37,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-01 17:14:37,302 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2019-01-01 17:14:37,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:14:37,304 INFO L225 Difference]: With dead ends: 98 [2019-01-01 17:14:37,304 INFO L226 Difference]: Without dead ends: 98 [2019-01-01 17:14:37,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2019-01-01 17:14:37,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-01 17:14:37,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 50. [2019-01-01 17:14:37,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-01 17:14:37,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2019-01-01 17:14:37,314 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 18 [2019-01-01 17:14:37,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:14:37,314 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2019-01-01 17:14:37,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-01 17:14:37,315 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2019-01-01 17:14:37,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-01 17:14:37,315 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:14:37,316 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:14:37,316 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrreplaceErr3REQUIRES_VIOLATION, cstrreplaceErr4REQUIRES_VIOLATION, cstrreplaceErr5REQUIRES_VIOLATION, cstrreplaceErr0REQUIRES_VIOLATION, cstrreplaceErr2REQUIRES_VIOLATION, cstrreplaceErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-01 17:14:37,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:14:37,316 INFO L82 PathProgramCache]: Analyzing trace with hash 2074353322, now seen corresponding path program 1 times [2019-01-01 17:14:37,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:14:37,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:14:37,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:37,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:14:37,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:37,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:14:37,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-01 17:14:37,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:14:37,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 17:14:37,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 17:14:37,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 17:14:37,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:14:37,442 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 4 states. [2019-01-01 17:14:37,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:14:37,505 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2019-01-01 17:14:37,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 17:14:37,506 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-01-01 17:14:37,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:14:37,508 INFO L225 Difference]: With dead ends: 49 [2019-01-01 17:14:37,508 INFO L226 Difference]: Without dead ends: 34 [2019-01-01 17:14:37,509 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:14:37,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-01 17:14:37,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-01-01 17:14:37,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-01 17:14:37,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2019-01-01 17:14:37,513 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 19 [2019-01-01 17:14:37,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:14:37,513 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2019-01-01 17:14:37,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 17:14:37,513 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2019-01-01 17:14:37,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-01 17:14:37,514 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:14:37,514 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:14:37,514 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrreplaceErr3REQUIRES_VIOLATION, cstrreplaceErr4REQUIRES_VIOLATION, cstrreplaceErr5REQUIRES_VIOLATION, cstrreplaceErr0REQUIRES_VIOLATION, cstrreplaceErr2REQUIRES_VIOLATION, cstrreplaceErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-01 17:14:37,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:14:37,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1796611949, now seen corresponding path program 2 times [2019-01-01 17:14:37,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:14:37,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:14:37,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:37,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:14:37,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:37,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:14:37,875 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-01 17:14:38,120 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:14:38,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:14:38,121 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:14:38,133 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 17:14:38,158 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 17:14:38,158 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 17:14:38,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:14:38,168 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:14:38,169 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:14:38,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:14:38,175 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-01 17:14:38,215 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 16 treesize of output 13 [2019-01-01 17:14:38,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2019-01-01 17:14:38,218 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:14:38,220 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:14:38,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:14:38,267 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-01-01 17:14:38,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2019-01-01 17:14:38,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2019-01-01 17:14:38,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 17:14:38,501 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:14:38,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:14:38,518 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2019-01-01 17:14:38,580 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:14:38,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:14:38,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2019-01-01 17:14:38,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-01 17:14:38,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-01 17:14:38,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2019-01-01 17:14:38,601 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 16 states. [2019-01-01 17:14:39,086 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 41 [2019-01-01 17:14:39,336 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 35 [2019-01-01 17:14:39,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:14:39,824 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2019-01-01 17:14:39,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-01 17:14:39,825 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2019-01-01 17:14:39,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:14:39,825 INFO L225 Difference]: With dead ends: 67 [2019-01-01 17:14:39,826 INFO L226 Difference]: Without dead ends: 52 [2019-01-01 17:14:39,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=164, Invalid=766, Unknown=0, NotChecked=0, Total=930 [2019-01-01 17:14:39,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-01 17:14:39,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 41. [2019-01-01 17:14:39,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-01 17:14:39,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2019-01-01 17:14:39,830 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 23 [2019-01-01 17:14:39,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:14:39,830 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2019-01-01 17:14:39,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-01 17:14:39,831 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2019-01-01 17:14:39,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-01 17:14:39,832 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:14:39,832 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:14:39,832 INFO L423 AbstractCegarLoop]: === Iteration 9 === [cstrreplaceErr3REQUIRES_VIOLATION, cstrreplaceErr4REQUIRES_VIOLATION, cstrreplaceErr5REQUIRES_VIOLATION, cstrreplaceErr0REQUIRES_VIOLATION, cstrreplaceErr2REQUIRES_VIOLATION, cstrreplaceErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-01 17:14:39,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:14:39,832 INFO L82 PathProgramCache]: Analyzing trace with hash -909279002, now seen corresponding path program 1 times [2019-01-01 17:14:39,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:14:39,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:14:39,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:39,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 17:14:39,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:39,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:14:40,275 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:14:40,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:14:40,276 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:14:40,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:14:40,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:14:40,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:14:40,342 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:14:40,343 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:14:40,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:14:40,372 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-01 17:14:40,381 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 15 treesize of output 12 [2019-01-01 17:14:40,383 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 12 treesize of output 11 [2019-01-01 17:14:40,383 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:14:40,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:14:40,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:14:40,389 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-01-01 17:14:40,451 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 23 treesize of output 18 [2019-01-01 17:14:40,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 27 [2019-01-01 17:14:40,468 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 17:14:40,481 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:14:40,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:14:40,499 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:27 [2019-01-01 17:14:40,601 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 29 treesize of output 25 [2019-01-01 17:14:40,617 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 15 treesize of output 12 [2019-01-01 17:14:40,617 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 17:14:40,635 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:14:40,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:14:40,672 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:34 [2019-01-01 17:14:40,752 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:14:40,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:14:40,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 19 [2019-01-01 17:14:40,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-01 17:14:40,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-01 17:14:40,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2019-01-01 17:14:40,772 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 20 states. [2019-01-01 17:14:41,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:14:41,751 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2019-01-01 17:14:41,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-01 17:14:41,752 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2019-01-01 17:14:41,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:14:41,753 INFO L225 Difference]: With dead ends: 40 [2019-01-01 17:14:41,753 INFO L226 Difference]: Without dead ends: 0 [2019-01-01 17:14:41,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=270, Invalid=786, Unknown=0, NotChecked=0, Total=1056 [2019-01-01 17:14:41,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-01 17:14:41,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-01 17:14:41,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-01 17:14:41,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 17:14:41,755 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2019-01-01 17:14:41,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:14:41,756 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 17:14:41,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-01 17:14:41,756 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-01 17:14:41,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-01 17:14:41,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 05:14:41 BoogieIcfgContainer [2019-01-01 17:14:41,762 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 17:14:41,762 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 17:14:41,762 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 17:14:41,762 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 17:14:41,763 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:14:30" (3/4) ... [2019-01-01 17:14:41,767 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-01 17:14:41,775 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-01 17:14:41,775 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrreplace [2019-01-01 17:14:41,775 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-01-01 17:14:41,776 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-01-01 17:14:41,776 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-01 17:14:41,780 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2019-01-01 17:14:41,781 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-01-01 17:14:41,781 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-01 17:14:41,839 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 17:14:41,839 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 17:14:41,840 INFO L168 Benchmark]: Toolchain (without parser) took 13083.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 195.0 MB). Free memory was 954.1 MB in the beginning and 819.1 MB in the end (delta: 135.0 MB). Peak memory consumption was 330.0 MB. Max. memory is 11.5 GB. [2019-01-01 17:14:41,841 INFO L168 Benchmark]: CDTParser took 0.15 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:14:41,845 INFO L168 Benchmark]: CACSL2BoogieTranslator took 632.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 954.1 MB in the beginning and 1.1 GB in the end (delta: -147.0 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. [2019-01-01 17:14:41,846 INFO L168 Benchmark]: Boogie Preprocessor took 61.83 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 17:14:41,846 INFO L168 Benchmark]: RCFGBuilder took 777.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 11.5 GB. [2019-01-01 17:14:41,847 INFO L168 Benchmark]: TraceAbstraction took 11528.56 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 73.4 MB). Free memory was 1.1 GB in the beginning and 819.1 MB in the end (delta: 235.8 MB). Peak memory consumption was 309.2 MB. Max. memory is 11.5 GB. [2019-01-01 17:14:41,847 INFO L168 Benchmark]: Witness Printer took 77.33 ms. Allocated memory is still 1.2 GB. Free memory is still 819.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 17:14:41,854 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.15 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 632.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 954.1 MB in the beginning and 1.1 GB in the end (delta: -147.0 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 61.83 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 777.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11528.56 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 73.4 MB). Free memory was 1.1 GB in the beginning and 819.1 MB in the end (delta: 235.8 MB). Peak memory consumption was 309.2 MB. Max. memory is 11.5 GB. * Witness Printer took 77.33 ms. Allocated memory is still 1.2 GB. Free memory is still 819.1 MB. There was no memory consumed. 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: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 559]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 559]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 553]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 42 locations, 9 error locations. SAFE Result, 11.4s OverallTime, 9 OverallIterations, 3 TraceHistogramMax, 7.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 216 SDtfs, 392 SDslu, 783 SDs, 0 SdLazy, 752 SolverSat, 143 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 170 GetRequests, 59 SyntacticMatches, 5 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=6, 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, 9 MinimizatonAttempts, 67 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 223 NumberOfCodeBlocks, 223 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 211 ConstructedInterpolants, 11 QuantifiedInterpolants, 45394 SizeOfPredicates, 25 NumberOfNonLiveVariables, 350 ConjunctsInSsa, 86 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 8/53 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...