./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/array-memsafety/openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/array-memsafety/openbsd_cstpcpy-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 2995aa83f0315dcda376bb0d80edf8fb8acf3951 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 22:43:44,618 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 22:43:44,623 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 22:43:44,640 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 22:43:44,641 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 22:43:44,642 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 22:43:44,643 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 22:43:44,645 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 22:43:44,647 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 22:43:44,647 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 22:43:44,649 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 22:43:44,649 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 22:43:44,650 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 22:43:44,651 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 22:43:44,652 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 22:43:44,653 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 22:43:44,654 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 22:43:44,656 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 22:43:44,658 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 22:43:44,660 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 22:43:44,661 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 22:43:44,662 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 22:43:44,665 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 22:43:44,665 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 22:43:44,665 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 22:43:44,666 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 22:43:44,667 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 22:43:44,669 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 22:43:44,669 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 22:43:44,670 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 22:43:44,671 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 22:43:44,672 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 22:43:44,672 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 22:43:44,672 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 22:43:44,673 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 22:43:44,674 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 22:43:44,674 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-28 22:43:44,699 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 22:43:44,701 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 22:43:44,702 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 22:43:44,703 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 22:43:44,703 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 22:43:44,704 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 22:43:44,704 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 22:43:44,705 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 22:43:44,705 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 22:43:44,705 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 22:43:44,705 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 22:43:44,705 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 22:43:44,705 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 22:43:44,706 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 22:43:44,707 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 22:43:44,707 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-28 22:43:44,707 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 22:43:44,707 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 22:43:44,707 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 22:43:44,708 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 22:43:44,709 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 22:43:44,709 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 22:43:44,710 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 22:43:44,710 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 22:43:44,710 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 22:43:44,710 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 22:43:44,711 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 22:43:44,711 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 22:43:44,711 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 -> 2995aa83f0315dcda376bb0d80edf8fb8acf3951 [2018-11-28 22:43:44,752 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 22:43:44,764 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 22:43:44,768 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 22:43:44,769 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 22:43:44,770 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 22:43:44,770 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-11-28 22:43:44,840 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3b4ff2e7/3fbfe329842649d280aee72fd7c014d9/FLAG0ceab6d9d [2018-11-28 22:43:45,393 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 22:43:45,395 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-11-28 22:43:45,414 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3b4ff2e7/3fbfe329842649d280aee72fd7c014d9/FLAG0ceab6d9d [2018-11-28 22:43:45,627 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3b4ff2e7/3fbfe329842649d280aee72fd7c014d9 [2018-11-28 22:43:45,632 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 22:43:45,634 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 22:43:45,635 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 22:43:45,635 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 22:43:45,639 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 22:43:45,640 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:43:45" (1/1) ... [2018-11-28 22:43:45,644 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4624ebd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:45, skipping insertion in model container [2018-11-28 22:43:45,644 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:43:45" (1/1) ... [2018-11-28 22:43:45,653 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 22:43:45,702 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 22:43:46,043 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 22:43:46,062 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 22:43:46,117 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 22:43:46,182 INFO L195 MainTranslator]: Completed translation [2018-11-28 22:43:46,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:46 WrapperNode [2018-11-28 22:43:46,182 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 22:43:46,183 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 22:43:46,183 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 22:43:46,184 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 22:43:46,275 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:46" (1/1) ... [2018-11-28 22:43:46,276 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:46" (1/1) ... [2018-11-28 22:43:46,293 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:46" (1/1) ... [2018-11-28 22:43:46,293 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:46" (1/1) ... [2018-11-28 22:43:46,312 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:46" (1/1) ... [2018-11-28 22:43:46,317 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:46" (1/1) ... [2018-11-28 22:43:46,320 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:46" (1/1) ... [2018-11-28 22:43:46,326 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 22:43:46,328 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 22:43:46,329 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 22:43:46,329 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 22:43:46,330 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:46" (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 [2018-11-28 22:43:46,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 22:43:46,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 22:43:46,385 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-28 22:43:46,385 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-28 22:43:46,385 INFO L138 BoogieDeclarations]: Found implementation of procedure cstpcpy [2018-11-28 22:43:46,385 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 22:43:46,385 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-28 22:43:46,386 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-28 22:43:46,386 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-28 22:43:46,386 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-28 22:43:46,386 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-28 22:43:46,386 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-28 22:43:46,387 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-28 22:43:46,388 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-28 22:43:46,388 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-28 22:43:46,388 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-28 22:43:46,389 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-28 22:43:46,389 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-28 22:43:46,389 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-28 22:43:46,389 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-28 22:43:46,389 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-28 22:43:46,389 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-28 22:43:46,390 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-28 22:43:46,390 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-28 22:43:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-28 22:43:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-28 22:43:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-28 22:43:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-28 22:43:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-28 22:43:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-28 22:43:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-28 22:43:46,392 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-28 22:43:46,392 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-28 22:43:46,392 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-28 22:43:46,392 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-28 22:43:46,392 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-28 22:43:46,392 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-28 22:43:46,393 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-28 22:43:46,394 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-28 22:43:46,394 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-28 22:43:46,394 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-28 22:43:46,394 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-28 22:43:46,394 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-28 22:43:46,394 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-28 22:43:46,394 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-28 22:43:46,395 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-28 22:43:46,395 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-28 22:43:46,396 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-28 22:43:46,396 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-28 22:43:46,396 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-28 22:43:46,396 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-28 22:43:46,396 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-28 22:43:46,396 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-28 22:43:46,396 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-28 22:43:46,396 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-28 22:43:46,397 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-28 22:43:46,397 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-28 22:43:46,397 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-28 22:43:46,397 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-28 22:43:46,397 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-28 22:43:46,397 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-28 22:43:46,397 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-28 22:43:46,397 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-28 22:43:46,399 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-28 22:43:46,399 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-28 22:43:46,400 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-28 22:43:46,400 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-28 22:43:46,400 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-28 22:43:46,400 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-28 22:43:46,400 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-28 22:43:46,400 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-28 22:43:46,400 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-28 22:43:46,400 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-28 22:43:46,402 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-28 22:43:46,402 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-28 22:43:46,402 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-28 22:43:46,402 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-28 22:43:46,402 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-28 22:43:46,402 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-28 22:43:46,402 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-28 22:43:46,403 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-28 22:43:46,403 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-28 22:43:46,404 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-28 22:43:46,404 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-28 22:43:46,404 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-28 22:43:46,404 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-28 22:43:46,404 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-28 22:43:46,404 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-28 22:43:46,404 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-28 22:43:46,404 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-28 22:43:46,405 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-28 22:43:46,405 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-28 22:43:46,405 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-28 22:43:46,405 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-28 22:43:46,405 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-28 22:43:46,405 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-28 22:43:46,405 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-28 22:43:46,405 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-28 22:43:46,407 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-28 22:43:46,407 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-28 22:43:46,408 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-28 22:43:46,408 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-28 22:43:46,408 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-28 22:43:46,408 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-28 22:43:46,408 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-28 22:43:46,408 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-28 22:43:46,408 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-28 22:43:46,408 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-28 22:43:46,409 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-28 22:43:46,410 INFO L130 BoogieDeclarations]: Found specification of procedure cstpcpy [2018-11-28 22:43:46,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 22:43:46,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 22:43:46,410 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 22:43:46,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 22:43:46,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 22:43:46,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 22:43:46,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 22:43:47,055 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 22:43:47,056 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-28 22:43:47,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:43:47 BoogieIcfgContainer [2018-11-28 22:43:47,056 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 22:43:47,057 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 22:43:47,057 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 22:43:47,061 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 22:43:47,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 10:43:45" (1/3) ... [2018-11-28 22:43:47,062 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@247d163a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:43:47, skipping insertion in model container [2018-11-28 22:43:47,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:46" (2/3) ... [2018-11-28 22:43:47,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@247d163a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:43:47, skipping insertion in model container [2018-11-28 22:43:47,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:43:47" (3/3) ... [2018-11-28 22:43:47,066 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-11-28 22:43:47,077 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 22:43:47,086 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-11-28 22:43:47,104 INFO L257 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2018-11-28 22:43:47,132 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 22:43:47,133 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 22:43:47,133 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 22:43:47,133 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 22:43:47,134 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 22:43:47,134 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 22:43:47,134 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 22:43:47,134 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 22:43:47,134 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 22:43:47,150 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-28 22:43:47,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 22:43:47,161 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:47,162 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:47,165 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpcpyErr0REQUIRES_VIOLATION, cstpcpyErr2REQUIRES_VIOLATION, cstpcpyErr1REQUIRES_VIOLATION, cstpcpyErr3REQUIRES_VIOLATION]=== [2018-11-28 22:43:47,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:47,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1166122888, now seen corresponding path program 1 times [2018-11-28 22:43:47,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:47,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:47,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:47,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:47,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:47,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:47,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:47,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:47,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 22:43:47,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 22:43:47,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 22:43:47,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 22:43:47,377 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 4 states. [2018-11-28 22:43:47,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:47,690 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-28 22:43:47,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 22:43:47,692 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-11-28 22:43:47,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:47,700 INFO L225 Difference]: With dead ends: 35 [2018-11-28 22:43:47,700 INFO L226 Difference]: Without dead ends: 31 [2018-11-28 22:43:47,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 22:43:47,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-28 22:43:47,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-11-28 22:43:47,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-28 22:43:47,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-11-28 22:43:47,739 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 10 [2018-11-28 22:43:47,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:47,739 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-11-28 22:43:47,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 22:43:47,739 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-28 22:43:47,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 22:43:47,740 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:47,740 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:47,741 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpcpyErr0REQUIRES_VIOLATION, cstpcpyErr2REQUIRES_VIOLATION, cstpcpyErr1REQUIRES_VIOLATION, cstpcpyErr3REQUIRES_VIOLATION]=== [2018-11-28 22:43:47,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:47,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1166122862, now seen corresponding path program 1 times [2018-11-28 22:43:47,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:47,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:47,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:47,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:47,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:47,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:47,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:47,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:47,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 22:43:47,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 22:43:47,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 22:43:47,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:43:47,833 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 3 states. [2018-11-28 22:43:47,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:47,878 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-11-28 22:43:47,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 22:43:47,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-28 22:43:47,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:47,880 INFO L225 Difference]: With dead ends: 28 [2018-11-28 22:43:47,881 INFO L226 Difference]: Without dead ends: 28 [2018-11-28 22:43:47,882 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 [2018-11-28 22:43:47,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-28 22:43:47,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-28 22:43:47,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-28 22:43:47,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-11-28 22:43:47,887 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 10 [2018-11-28 22:43:47,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:47,887 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-11-28 22:43:47,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 22:43:47,887 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-28 22:43:47,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 22:43:47,888 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:47,888 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:47,888 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpcpyErr0REQUIRES_VIOLATION, cstpcpyErr2REQUIRES_VIOLATION, cstpcpyErr1REQUIRES_VIOLATION, cstpcpyErr3REQUIRES_VIOLATION]=== [2018-11-28 22:43:47,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:47,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1166122861, now seen corresponding path program 1 times [2018-11-28 22:43:47,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:47,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:47,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:47,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:47,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:47,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:48,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:48,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:48,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 22:43:48,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 22:43:48,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 22:43:48,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 22:43:48,042 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 4 states. [2018-11-28 22:43:48,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:48,073 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-11-28 22:43:48,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 22:43:48,074 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-11-28 22:43:48,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:48,074 INFO L225 Difference]: With dead ends: 29 [2018-11-28 22:43:48,075 INFO L226 Difference]: Without dead ends: 29 [2018-11-28 22:43:48,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 22:43:48,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-28 22:43:48,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-11-28 22:43:48,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-28 22:43:48,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-11-28 22:43:48,081 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 10 [2018-11-28 22:43:48,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:48,081 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-11-28 22:43:48,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 22:43:48,082 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-28 22:43:48,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 22:43:48,082 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:48,082 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:48,083 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpcpyErr0REQUIRES_VIOLATION, cstpcpyErr2REQUIRES_VIOLATION, cstpcpyErr1REQUIRES_VIOLATION, cstpcpyErr3REQUIRES_VIOLATION]=== [2018-11-28 22:43:48,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:48,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1166120966, now seen corresponding path program 1 times [2018-11-28 22:43:48,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:48,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:48,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:48,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:48,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:48,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:48,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:48,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:48,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 22:43:48,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 22:43:48,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 22:43:48,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:43:48,148 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 3 states. [2018-11-28 22:43:48,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:48,314 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2018-11-28 22:43:48,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 22:43:48,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-28 22:43:48,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:48,315 INFO L225 Difference]: With dead ends: 28 [2018-11-28 22:43:48,315 INFO L226 Difference]: Without dead ends: 27 [2018-11-28 22:43:48,316 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 [2018-11-28 22:43:48,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-28 22:43:48,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-11-28 22:43:48,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-28 22:43:48,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-11-28 22:43:48,321 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 10 [2018-11-28 22:43:48,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:48,321 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-28 22:43:48,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 22:43:48,321 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-28 22:43:48,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-28 22:43:48,322 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:48,322 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:48,322 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpcpyErr0REQUIRES_VIOLATION, cstpcpyErr2REQUIRES_VIOLATION, cstpcpyErr1REQUIRES_VIOLATION, cstpcpyErr3REQUIRES_VIOLATION]=== [2018-11-28 22:43:48,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:48,323 INFO L82 PathProgramCache]: Analyzing trace with hash 2024299467, now seen corresponding path program 1 times [2018-11-28 22:43:48,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:48,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:48,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:48,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:48,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:48,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:48,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:48,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:48,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 22:43:48,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 22:43:48,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 22:43:48,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 22:43:48,446 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 5 states. [2018-11-28 22:43:48,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:48,543 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-11-28 22:43:48,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 22:43:48,544 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-28 22:43:48,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:48,545 INFO L225 Difference]: With dead ends: 25 [2018-11-28 22:43:48,545 INFO L226 Difference]: Without dead ends: 25 [2018-11-28 22:43:48,546 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 [2018-11-28 22:43:48,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-28 22:43:48,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-28 22:43:48,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-28 22:43:48,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-11-28 22:43:48,550 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 13 [2018-11-28 22:43:48,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:48,551 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-11-28 22:43:48,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 22:43:48,551 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-28 22:43:48,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-28 22:43:48,552 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:48,552 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:48,552 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpcpyErr0REQUIRES_VIOLATION, cstpcpyErr2REQUIRES_VIOLATION, cstpcpyErr1REQUIRES_VIOLATION, cstpcpyErr3REQUIRES_VIOLATION]=== [2018-11-28 22:43:48,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:48,552 INFO L82 PathProgramCache]: Analyzing trace with hash 2024299468, now seen corresponding path program 1 times [2018-11-28 22:43:48,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:48,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:48,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:48,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:48,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:48,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:48,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:48,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:48,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 22:43:48,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 22:43:48,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 22:43:48,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 22:43:48,927 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 7 states. [2018-11-28 22:43:49,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:49,129 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-28 22:43:49,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 22:43:49,130 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-11-28 22:43:49,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:49,134 INFO L225 Difference]: With dead ends: 34 [2018-11-28 22:43:49,134 INFO L226 Difference]: Without dead ends: 34 [2018-11-28 22:43:49,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-28 22:43:49,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-28 22:43:49,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 26. [2018-11-28 22:43:49,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-28 22:43:49,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-11-28 22:43:49,139 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 13 [2018-11-28 22:43:49,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:49,139 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-28 22:43:49,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 22:43:49,139 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-28 22:43:49,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 22:43:49,140 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:49,140 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:49,140 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpcpyErr0REQUIRES_VIOLATION, cstpcpyErr2REQUIRES_VIOLATION, cstpcpyErr1REQUIRES_VIOLATION, cstpcpyErr3REQUIRES_VIOLATION]=== [2018-11-28 22:43:49,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:49,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1671225958, now seen corresponding path program 1 times [2018-11-28 22:43:49,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:49,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:49,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:49,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:49,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:49,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:49,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:49,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:49,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 22:43:49,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 22:43:49,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 22:43:49,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 22:43:49,267 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 6 states. [2018-11-28 22:43:49,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:49,355 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-11-28 22:43:49,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 22:43:49,356 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-28 22:43:49,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:49,357 INFO L225 Difference]: With dead ends: 25 [2018-11-28 22:43:49,358 INFO L226 Difference]: Without dead ends: 25 [2018-11-28 22:43:49,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-28 22:43:49,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-28 22:43:49,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-28 22:43:49,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-28 22:43:49,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-11-28 22:43:49,362 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 14 [2018-11-28 22:43:49,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:49,362 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-11-28 22:43:49,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 22:43:49,364 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-28 22:43:49,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 22:43:49,364 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:49,364 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:49,365 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpcpyErr0REQUIRES_VIOLATION, cstpcpyErr2REQUIRES_VIOLATION, cstpcpyErr1REQUIRES_VIOLATION, cstpcpyErr3REQUIRES_VIOLATION]=== [2018-11-28 22:43:49,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:49,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1671225957, now seen corresponding path program 1 times [2018-11-28 22:43:49,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:49,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:49,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:49,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:49,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:49,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:49,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:49,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:49,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 22:43:49,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 22:43:49,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 22:43:49,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 22:43:49,505 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 6 states. [2018-11-28 22:43:49,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:49,660 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-11-28 22:43:49,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 22:43:49,660 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-28 22:43:49,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:49,662 INFO L225 Difference]: With dead ends: 31 [2018-11-28 22:43:49,662 INFO L226 Difference]: Without dead ends: 31 [2018-11-28 22:43:49,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-28 22:43:49,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-28 22:43:49,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2018-11-28 22:43:49,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-28 22:43:49,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-11-28 22:43:49,666 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 14 [2018-11-28 22:43:49,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:49,667 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-28 22:43:49,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 22:43:49,667 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-28 22:43:49,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-28 22:43:49,668 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:49,668 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:49,668 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpcpyErr0REQUIRES_VIOLATION, cstpcpyErr2REQUIRES_VIOLATION, cstpcpyErr1REQUIRES_VIOLATION, cstpcpyErr3REQUIRES_VIOLATION]=== [2018-11-28 22:43:49,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:49,668 INFO L82 PathProgramCache]: Analyzing trace with hash -231607577, now seen corresponding path program 1 times [2018-11-28 22:43:49,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:49,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:49,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:49,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:49,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:49,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:49,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:49,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:49,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 22:43:49,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 22:43:49,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 22:43:49,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-28 22:43:49,888 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 8 states. [2018-11-28 22:43:50,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:50,029 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-11-28 22:43:50,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 22:43:50,030 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-11-28 22:43:50,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:50,031 INFO L225 Difference]: With dead ends: 39 [2018-11-28 22:43:50,031 INFO L226 Difference]: Without dead ends: 39 [2018-11-28 22:43:50,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-11-28 22:43:50,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-28 22:43:50,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-11-28 22:43:50,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-28 22:43:50,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-11-28 22:43:50,038 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 17 [2018-11-28 22:43:50,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:50,038 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-11-28 22:43:50,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 22:43:50,038 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-11-28 22:43:50,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-28 22:43:50,039 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:50,039 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:50,040 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpcpyErr0REQUIRES_VIOLATION, cstpcpyErr2REQUIRES_VIOLATION, cstpcpyErr1REQUIRES_VIOLATION, cstpcpyErr3REQUIRES_VIOLATION]=== [2018-11-28 22:43:50,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:50,040 INFO L82 PathProgramCache]: Analyzing trace with hash -624634587, now seen corresponding path program 1 times [2018-11-28 22:43:50,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:50,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:50,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:50,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:50,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:50,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:50,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:50,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:50,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 22:43:50,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 22:43:50,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 22:43:50,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-28 22:43:50,237 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 9 states. [2018-11-28 22:43:50,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:50,402 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-11-28 22:43:50,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 22:43:50,403 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-11-28 22:43:50,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:50,404 INFO L225 Difference]: With dead ends: 60 [2018-11-28 22:43:50,404 INFO L226 Difference]: Without dead ends: 60 [2018-11-28 22:43:50,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-11-28 22:43:50,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-28 22:43:50,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 37. [2018-11-28 22:43:50,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-28 22:43:50,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-11-28 22:43:50,410 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 17 [2018-11-28 22:43:50,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:50,410 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-11-28 22:43:50,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 22:43:50,410 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-11-28 22:43:50,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-28 22:43:50,411 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:50,411 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:50,411 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpcpyErr0REQUIRES_VIOLATION, cstpcpyErr2REQUIRES_VIOLATION, cstpcpyErr1REQUIRES_VIOLATION, cstpcpyErr3REQUIRES_VIOLATION]=== [2018-11-28 22:43:50,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:50,412 INFO L82 PathProgramCache]: Analyzing trace with hash 76429991, now seen corresponding path program 1 times [2018-11-28 22:43:50,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:50,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:50,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:50,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:50,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:50,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:50,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:50,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:43:50,757 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 [2018-11-28 22:43:50,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:50,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:50,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:43:50,884 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 [2018-11-28 22:43:50,890 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 [2018-11-28 22:43:50,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:43:50,892 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:43:50,912 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. [2018-11-28 22:43:50,913 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-11-28 22:43:51,148 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 [2018-11-28 22:43:51,191 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 [2018-11-28 22:43:51,192 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 22:43:51,198 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:43:51,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:43:51,222 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-11-28 22:43:51,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:51,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:43:51,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2018-11-28 22:43:51,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-28 22:43:51,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-28 22:43:51,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-11-28 22:43:51,388 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 15 states. [2018-11-28 22:43:52,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:52,279 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-11-28 22:43:52,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 22:43:52,280 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2018-11-28 22:43:52,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:52,281 INFO L225 Difference]: With dead ends: 50 [2018-11-28 22:43:52,281 INFO L226 Difference]: Without dead ends: 50 [2018-11-28 22:43:52,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2018-11-28 22:43:52,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-28 22:43:52,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 40. [2018-11-28 22:43:52,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-28 22:43:52,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-11-28 22:43:52,288 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 17 [2018-11-28 22:43:52,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:52,288 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-11-28 22:43:52,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-28 22:43:52,289 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-28 22:43:52,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 22:43:52,290 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:52,290 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:52,290 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpcpyErr0REQUIRES_VIOLATION, cstpcpyErr2REQUIRES_VIOLATION, cstpcpyErr1REQUIRES_VIOLATION, cstpcpyErr3REQUIRES_VIOLATION]=== [2018-11-28 22:43:52,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:52,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1925637600, now seen corresponding path program 1 times [2018-11-28 22:43:52,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:52,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:52,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:52,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:52,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:52,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:52,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:52,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:43:52,453 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 [2018-11-28 22:43:52,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:52,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:52,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:43:52,639 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-28 22:43:52,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 22:43:52,642 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:43:52,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-28 22:43:52,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-11-28 22:43:52,660 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 22:43:52,666 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:43:52,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:43:52,677 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:25, output treesize:15 [2018-11-28 22:43:52,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:52,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:43:52,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2018-11-28 22:43:52,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-28 22:43:52,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-28 22:43:52,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-11-28 22:43:52,872 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 15 states. [2018-11-28 22:43:53,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:53,646 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-11-28 22:43:53,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 22:43:53,647 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2018-11-28 22:43:53,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:53,649 INFO L225 Difference]: With dead ends: 48 [2018-11-28 22:43:53,649 INFO L226 Difference]: Without dead ends: 48 [2018-11-28 22:43:53,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2018-11-28 22:43:53,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-28 22:43:53,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 39. [2018-11-28 22:43:53,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-28 22:43:53,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-11-28 22:43:53,655 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 18 [2018-11-28 22:43:53,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:53,656 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-11-28 22:43:53,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-28 22:43:53,656 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-28 22:43:53,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 22:43:53,656 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:53,657 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:53,657 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpcpyErr0REQUIRES_VIOLATION, cstpcpyErr2REQUIRES_VIOLATION, cstpcpyErr1REQUIRES_VIOLATION, cstpcpyErr3REQUIRES_VIOLATION]=== [2018-11-28 22:43:53,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:53,657 INFO L82 PathProgramCache]: Analyzing trace with hash 2138055530, now seen corresponding path program 1 times [2018-11-28 22:43:53,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:53,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:53,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:53,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:53,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:53,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:53,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:53,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:53,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 22:43:53,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 22:43:53,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 22:43:53,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 22:43:53,722 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 4 states. [2018-11-28 22:43:53,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:53,774 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2018-11-28 22:43:53,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 22:43:53,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-11-28 22:43:53,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:53,776 INFO L225 Difference]: With dead ends: 38 [2018-11-28 22:43:53,776 INFO L226 Difference]: Without dead ends: 22 [2018-11-28 22:43:53,777 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 [2018-11-28 22:43:53,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-28 22:43:53,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-28 22:43:53,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-28 22:43:53,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-11-28 22:43:53,780 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-11-28 22:43:53,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:53,781 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-11-28 22:43:53,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 22:43:53,781 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-28 22:43:53,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 22:43:53,781 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:53,781 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:53,784 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpcpyErr0REQUIRES_VIOLATION, cstpcpyErr2REQUIRES_VIOLATION, cstpcpyErr1REQUIRES_VIOLATION, cstpcpyErr3REQUIRES_VIOLATION]=== [2018-11-28 22:43:53,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:53,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1208413250, now seen corresponding path program 2 times [2018-11-28 22:43:53,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:53,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:53,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:53,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:53,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:53,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:54,089 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2018-11-28 22:43:54,506 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:54,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:43:54,506 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 [2018-11-28 22:43:54,516 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 22:43:54,570 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 22:43:54,570 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 22:43:54,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:43:54,913 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-28 22:43:54,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 22:43:54,931 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:43:54,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:43:54,940 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-28 22:43:54,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-11-28 22:43:54,963 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 [2018-11-28 22:43:54,964 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:43:54,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:43:55,051 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. [2018-11-28 22:43:55,051 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-11-28 22:43:55,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-11-28 22:43:55,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 22:43:55,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:43:55,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:43:55,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 22:43:55,227 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:42 [2018-11-28 22:43:55,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2018-11-28 22:43:55,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 9 treesize of output 1 [2018-11-28 22:43:55,434 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:43:55,449 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:43:55,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 31 [2018-11-28 22:43:55,460 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 22:43:55,475 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:43:55,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:43:55,501 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:60, output treesize:43 [2018-11-28 22:43:55,584 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:55,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:43:55,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 20 [2018-11-28 22:43:55,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-28 22:43:55,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-28 22:43:55,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2018-11-28 22:43:55,605 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2018-11-28 22:43:56,253 WARN L180 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2018-11-28 22:43:57,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:57,455 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-28 22:43:57,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 22:43:57,456 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2018-11-28 22:43:57,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:57,457 INFO L225 Difference]: With dead ends: 29 [2018-11-28 22:43:57,457 INFO L226 Difference]: Without dead ends: 29 [2018-11-28 22:43:57,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=111, Invalid=819, Unknown=0, NotChecked=0, Total=930 [2018-11-28 22:43:57,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-28 22:43:57,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2018-11-28 22:43:57,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-28 22:43:57,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-11-28 22:43:57,461 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 21 [2018-11-28 22:43:57,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:57,461 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-11-28 22:43:57,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-28 22:43:57,462 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-28 22:43:57,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 22:43:57,462 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:57,462 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:57,463 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpcpyErr0REQUIRES_VIOLATION, cstpcpyErr2REQUIRES_VIOLATION, cstpcpyErr1REQUIRES_VIOLATION, cstpcpyErr3REQUIRES_VIOLATION]=== [2018-11-28 22:43:57,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:57,463 INFO L82 PathProgramCache]: Analyzing trace with hash -699967395, now seen corresponding path program 3 times [2018-11-28 22:43:57,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:57,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:57,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:57,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 22:43:57,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:57,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:57,761 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 22:43:57,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:43:57,762 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 22:43:57,771 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 22:43:57,821 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-28 22:43:57,821 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 22:43:57,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:43:57,944 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-28 22:43:57,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 22:43:57,959 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:43:58,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-28 22:43:58,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-11-28 22:43:58,124 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 22:43:58,217 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:43:58,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:43:58,226 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2018-11-28 22:43:58,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-28 22:43:58,247 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 [2018-11-28 22:43:58,247 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:43:58,250 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:43:58,259 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. [2018-11-28 22:43:58,259 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-11-28 22:43:58,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-11-28 22:43:58,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 22:43:58,319 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:43:58,324 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:43:58,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:43:58,335 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-11-28 22:43:58,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-11-28 22:43:58,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 22:43:58,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:43:58,357 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:43:58,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:43:58,364 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2018-11-28 22:43:58,387 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 19 treesize of output 15 [2018-11-28 22:43:58,396 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 [2018-11-28 22:43:58,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 22:43:58,403 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:43:58,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:43:58,410 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-11-28 22:43:58,453 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 22:43:58,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:43:58,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-11-28 22:43:58,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-28 22:43:58,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 22:43:58,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-11-28 22:43:58,481 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 14 states. [2018-11-28 22:43:59,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:59,018 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-11-28 22:43:59,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 22:43:59,019 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2018-11-28 22:43:59,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:59,019 INFO L225 Difference]: With dead ends: 25 [2018-11-28 22:43:59,020 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 22:43:59,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 18 SyntacticMatches, 8 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2018-11-28 22:43:59,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 22:43:59,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 22:43:59,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 22:43:59,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 22:43:59,021 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2018-11-28 22:43:59,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:59,021 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 22:43:59,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-28 22:43:59,021 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 22:43:59,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 22:43:59,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 10:43:59 BoogieIcfgContainer [2018-11-28 22:43:59,027 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 22:43:59,028 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 22:43:59,028 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 22:43:59,028 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 22:43:59,029 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:43:47" (3/4) ... [2018-11-28 22:43:59,033 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 22:43:59,040 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 22:43:59,040 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-11-28 22:43:59,040 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-11-28 22:43:59,041 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 22:43:59,041 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstpcpy [2018-11-28 22:43:59,045 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-11-28 22:43:59,045 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-28 22:43:59,045 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-28 22:43:59,090 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 22:43:59,090 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 22:43:59,091 INFO L168 Benchmark]: Toolchain (without parser) took 13458.69 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 288.4 MB). Free memory was 952.7 MB in the beginning and 1.2 GB in the end (delta: -231.6 MB). Peak memory consumption was 56.8 MB. Max. memory is 11.5 GB. [2018-11-28 22:43:59,092 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 22:43:59,092 INFO L168 Benchmark]: CACSL2BoogieTranslator took 548.22 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 931.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-28 22:43:59,093 INFO L168 Benchmark]: Boogie Preprocessor took 144.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -201.1 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-11-28 22:43:59,093 INFO L168 Benchmark]: RCFGBuilder took 728.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.6 MB). Peak memory consumption was 38.6 MB. Max. memory is 11.5 GB. [2018-11-28 22:43:59,094 INFO L168 Benchmark]: TraceAbstraction took 11970.30 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 142.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -90.6 MB). Peak memory consumption was 52.0 MB. Max. memory is 11.5 GB. [2018-11-28 22:43:59,095 INFO L168 Benchmark]: Witness Printer took 62.44 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 22:43:59,098 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 548.22 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 931.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 144.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -201.1 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 728.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.6 MB). Peak memory consumption was 38.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11970.30 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 142.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -90.6 MB). Peak memory consumption was 52.0 MB. Max. memory is 11.5 GB. * Witness Printer took 62.44 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 557]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 557]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 542]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 542]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 542]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 542]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 7 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 37 locations, 7 error locations. SAFE Result, 11.9s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 5.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 297 SDtfs, 322 SDslu, 989 SDs, 0 SdLazy, 903 SolverSat, 87 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 216 GetRequests, 70 SyntacticMatches, 9 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 6.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=11, 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, 15 MinimizatonAttempts, 66 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 310 NumberOfCodeBlocks, 310 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 291 ConstructedInterpolants, 12 QuantifiedInterpolants, 41037 SizeOfPredicates, 41 NumberOfNonLiveVariables, 474 ConjunctsInSsa, 133 ConjunctsInUnsatCore, 19 InterpolantComputations, 11 PerfectInterpolantSequences, 8/50 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...