./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memcleanup.prp --file /storage/repos/svcomp/c/list-properties/simple_false-unreach-call_false-valid-memcleanup.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/list-properties/simple_false-unreach-call_false-valid-memcleanup.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7716826f9b443d6310df8de2d829a4d2f71b85a7 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memtrack) --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 00:54:14,612 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 00:54:14,615 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 00:54:14,626 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 00:54:14,627 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 00:54:14,628 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 00:54:14,629 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 00:54:14,631 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 00:54:14,633 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 00:54:14,634 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 00:54:14,635 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 00:54:14,635 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 00:54:14,637 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 00:54:14,638 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 00:54:14,639 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 00:54:14,640 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 00:54:14,641 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 00:54:14,643 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 00:54:14,645 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 00:54:14,647 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 00:54:14,648 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 00:54:14,650 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 00:54:14,652 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 00:54:14,652 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 00:54:14,653 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 00:54:14,653 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 00:54:14,654 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 00:54:14,656 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 00:54:14,657 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 00:54:14,658 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 00:54:14,658 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 00:54:14,659 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 00:54:14,659 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 00:54:14,659 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 00:54:14,661 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 00:54:14,661 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 00:54:14,662 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2019-01-14 00:54:14,685 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 00:54:14,685 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 00:54:14,687 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 00:54:14,687 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 00:54:14,688 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 00:54:14,688 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 00:54:14,688 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 00:54:14,689 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 00:54:14,689 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 00:54:14,689 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 00:54:14,689 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 00:54:14,689 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-14 00:54:14,689 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-14 00:54:14,690 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 00:54:14,690 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 00:54:14,690 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 00:54:14,690 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 00:54:14,690 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 00:54:14,690 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 00:54:14,691 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 00:54:14,691 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 00:54:14,692 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 00:54:14,692 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 00:54:14,692 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 00:54:14,692 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 00:54:14,692 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-memcleanup) ) 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 -> 7716826f9b443d6310df8de2d829a4d2f71b85a7 [2019-01-14 00:54:14,738 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 00:54:14,751 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 00:54:14,755 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 00:54:14,757 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 00:54:14,757 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 00:54:14,758 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/list-properties/simple_false-unreach-call_false-valid-memcleanup.i [2019-01-14 00:54:14,814 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f091e581/5833e78f4a5941d3a9ea41a1bbe1efe9/FLAG83c88c697 [2019-01-14 00:54:15,284 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 00:54:15,285 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-properties/simple_false-unreach-call_false-valid-memcleanup.i [2019-01-14 00:54:15,303 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f091e581/5833e78f4a5941d3a9ea41a1bbe1efe9/FLAG83c88c697 [2019-01-14 00:54:15,584 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f091e581/5833e78f4a5941d3a9ea41a1bbe1efe9 [2019-01-14 00:54:15,587 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 00:54:15,589 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-14 00:54:15,590 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 00:54:15,590 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 00:54:15,593 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 00:54:15,594 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 12:54:15" (1/1) ... [2019-01-14 00:54:15,597 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@436fcec2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:54:15, skipping insertion in model container [2019-01-14 00:54:15,597 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 12:54:15" (1/1) ... [2019-01-14 00:54:15,606 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 00:54:15,661 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 00:54:15,960 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 00:54:15,982 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 00:54:16,107 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 00:54:16,163 INFO L195 MainTranslator]: Completed translation [2019-01-14 00:54:16,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:54:16 WrapperNode [2019-01-14 00:54:16,164 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 00:54:16,165 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 00:54:16,165 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 00:54:16,165 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 00:54:16,179 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:54:16" (1/1) ... [2019-01-14 00:54:16,180 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:54:16" (1/1) ... [2019-01-14 00:54:16,197 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:54:16" (1/1) ... [2019-01-14 00:54:16,197 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:54:16" (1/1) ... [2019-01-14 00:54:16,212 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:54:16" (1/1) ... [2019-01-14 00:54:16,217 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:54:16" (1/1) ... [2019-01-14 00:54:16,220 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:54:16" (1/1) ... [2019-01-14 00:54:16,226 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 00:54:16,226 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 00:54:16,226 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 00:54:16,226 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 00:54:16,228 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:54:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 00:54:16,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-14 00:54:16,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 00:54:16,280 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-01-14 00:54:16,280 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-14 00:54:16,280 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-14 00:54:16,281 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-14 00:54:16,281 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-14 00:54:16,281 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-14 00:54:16,281 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-14 00:54:16,281 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-14 00:54:16,281 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-14 00:54:16,281 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-14 00:54:16,282 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-14 00:54:16,282 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-14 00:54:16,282 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-14 00:54:16,282 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-14 00:54:16,282 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-14 00:54:16,283 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-14 00:54:16,283 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-14 00:54:16,283 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-14 00:54:16,283 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-14 00:54:16,283 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-14 00:54:16,283 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-14 00:54:16,284 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-14 00:54:16,284 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-14 00:54:16,284 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-14 00:54:16,284 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-14 00:54:16,284 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-14 00:54:16,285 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-14 00:54:16,285 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-14 00:54:16,285 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-14 00:54:16,285 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-14 00:54:16,285 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-14 00:54:16,285 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-14 00:54:16,285 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-14 00:54:16,286 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-14 00:54:16,286 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-14 00:54:16,286 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-14 00:54:16,286 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-14 00:54:16,286 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-14 00:54:16,286 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-14 00:54:16,287 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-14 00:54:16,287 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-14 00:54:16,288 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-14 00:54:16,288 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-14 00:54:16,288 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-14 00:54:16,288 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-14 00:54:16,288 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-14 00:54:16,288 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-14 00:54:16,289 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-14 00:54:16,289 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-14 00:54:16,289 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-14 00:54:16,289 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-14 00:54:16,289 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-14 00:54:16,289 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-14 00:54:16,289 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-14 00:54:16,290 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-14 00:54:16,290 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-14 00:54:16,290 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-14 00:54:16,290 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-14 00:54:16,290 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-14 00:54:16,290 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-14 00:54:16,291 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-14 00:54:16,292 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-14 00:54:16,292 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-14 00:54:16,292 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-14 00:54:16,293 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-14 00:54:16,293 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-14 00:54:16,293 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-14 00:54:16,293 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-14 00:54:16,293 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2019-01-14 00:54:16,293 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-14 00:54:16,293 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-14 00:54:16,294 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-14 00:54:16,294 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-14 00:54:16,294 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-14 00:54:16,294 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-14 00:54:16,294 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-14 00:54:16,294 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-14 00:54:16,295 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-14 00:54:16,297 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-14 00:54:16,297 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-14 00:54:16,297 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-14 00:54:16,298 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-14 00:54:16,298 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-14 00:54:16,298 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-14 00:54:16,298 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-14 00:54:16,298 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-14 00:54:16,298 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-14 00:54:16,298 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-14 00:54:16,298 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-14 00:54:16,299 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-14 00:54:16,299 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-14 00:54:16,299 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-14 00:54:16,299 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-14 00:54:16,299 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-14 00:54:16,299 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-14 00:54:16,299 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-14 00:54:16,300 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-14 00:54:16,300 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-14 00:54:16,304 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-14 00:54:16,305 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-14 00:54:16,305 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-14 00:54:16,305 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-14 00:54:16,305 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-14 00:54:16,305 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-14 00:54:16,305 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-14 00:54:16,305 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-01-14 00:54:16,306 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-14 00:54:16,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 00:54:16,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 00:54:16,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 00:54:16,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 00:54:16,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 00:54:16,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-14 00:54:16,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 00:54:16,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 00:54:16,656 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-01-14 00:54:17,009 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 00:54:17,009 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-01-14 00:54:17,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 12:54:17 BoogieIcfgContainer [2019-01-14 00:54:17,011 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 00:54:17,012 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 00:54:17,012 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 00:54:17,015 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 00:54:17,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 12:54:15" (1/3) ... [2019-01-14 00:54:17,016 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44cd6660 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 12:54:17, skipping insertion in model container [2019-01-14 00:54:17,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:54:16" (2/3) ... [2019-01-14 00:54:17,016 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44cd6660 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 12:54:17, skipping insertion in model container [2019-01-14 00:54:17,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 12:54:17" (3/3) ... [2019-01-14 00:54:17,018 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_false-unreach-call_false-valid-memcleanup.i [2019-01-14 00:54:17,028 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 00:54:17,036 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2019-01-14 00:54:17,053 INFO L257 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2019-01-14 00:54:17,078 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 00:54:17,079 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 00:54:17,079 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-14 00:54:17,079 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 00:54:17,080 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 00:54:17,080 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 00:54:17,080 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 00:54:17,080 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 00:54:17,080 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 00:54:17,098 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states. [2019-01-14 00:54:17,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-14 00:54:17,108 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:54:17,109 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:54:17,111 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION]=== [2019-01-14 00:54:17,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:54:17,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1369312263, now seen corresponding path program 1 times [2019-01-14 00:54:17,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:54:17,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:54:17,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:54:17,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:54:17,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:54:17,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:54:17,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:54:17,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:54:17,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 00:54:17,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 00:54:17,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 00:54:17,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 00:54:17,293 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 3 states. [2019-01-14 00:54:17,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:54:17,656 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2019-01-14 00:54:17,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 00:54:17,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-01-14 00:54:17,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:54:17,670 INFO L225 Difference]: With dead ends: 51 [2019-01-14 00:54:17,670 INFO L226 Difference]: Without dead ends: 43 [2019-01-14 00:54:17,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 00:54:17,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-14 00:54:17,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-14 00:54:17,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-14 00:54:17,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-01-14 00:54:17,713 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 9 [2019-01-14 00:54:17,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:54:17,713 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-01-14 00:54:17,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 00:54:17,714 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-01-14 00:54:17,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-14 00:54:17,714 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:54:17,715 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:54:17,715 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION]=== [2019-01-14 00:54:17,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:54:17,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1369312264, now seen corresponding path program 1 times [2019-01-14 00:54:17,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:54:17,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:54:17,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:54:17,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:54:17,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:54:17,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:54:17,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:54:17,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:54:17,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 00:54:17,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 00:54:17,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 00:54:17,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 00:54:17,881 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 3 states. [2019-01-14 00:54:18,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:54:18,050 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2019-01-14 00:54:18,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 00:54:18,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-01-14 00:54:18,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:54:18,052 INFO L225 Difference]: With dead ends: 42 [2019-01-14 00:54:18,052 INFO L226 Difference]: Without dead ends: 42 [2019-01-14 00:54:18,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 00:54:18,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-14 00:54:18,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-01-14 00:54:18,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-14 00:54:18,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2019-01-14 00:54:18,059 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 9 [2019-01-14 00:54:18,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:54:18,059 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2019-01-14 00:54:18,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 00:54:18,060 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2019-01-14 00:54:18,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-14 00:54:18,060 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:54:18,060 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:54:18,061 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION]=== [2019-01-14 00:54:18,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:54:18,061 INFO L82 PathProgramCache]: Analyzing trace with hash -417757206, now seen corresponding path program 1 times [2019-01-14 00:54:18,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:54:18,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:54:18,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:54:18,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:54:18,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:54:18,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:54:18,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:54:18,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:54:18,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 00:54:18,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 00:54:18,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 00:54:18,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 00:54:18,165 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 4 states. [2019-01-14 00:54:18,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:54:18,713 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2019-01-14 00:54:18,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 00:54:18,717 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-01-14 00:54:18,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:54:18,719 INFO L225 Difference]: With dead ends: 71 [2019-01-14 00:54:18,719 INFO L226 Difference]: Without dead ends: 71 [2019-01-14 00:54:18,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 00:54:18,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-14 00:54:18,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 46. [2019-01-14 00:54:18,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-14 00:54:18,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2019-01-14 00:54:18,728 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 12 [2019-01-14 00:54:18,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:54:18,728 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2019-01-14 00:54:18,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 00:54:18,728 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2019-01-14 00:54:18,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-14 00:54:18,729 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:54:18,729 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:54:18,729 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION]=== [2019-01-14 00:54:18,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:54:18,730 INFO L82 PathProgramCache]: Analyzing trace with hash -417757205, now seen corresponding path program 1 times [2019-01-14 00:54:18,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:54:18,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:54:18,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:54:18,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:54:18,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:54:18,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:54:18,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:54:18,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:54:18,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 00:54:18,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 00:54:18,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 00:54:18,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 00:54:18,826 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 4 states. [2019-01-14 00:54:19,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:54:19,046 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2019-01-14 00:54:19,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 00:54:19,047 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-01-14 00:54:19,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:54:19,049 INFO L225 Difference]: With dead ends: 60 [2019-01-14 00:54:19,049 INFO L226 Difference]: Without dead ends: 60 [2019-01-14 00:54:19,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 00:54:19,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-14 00:54:19,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2019-01-14 00:54:19,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-14 00:54:19,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2019-01-14 00:54:19,056 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 12 [2019-01-14 00:54:19,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:54:19,057 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2019-01-14 00:54:19,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 00:54:19,057 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2019-01-14 00:54:19,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 00:54:19,058 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:54:19,058 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:54:19,058 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION]=== [2019-01-14 00:54:19,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:54:19,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1889449163, now seen corresponding path program 1 times [2019-01-14 00:54:19,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:54:19,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:54:19,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:54:19,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:54:19,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:54:19,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:54:19,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:54:19,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:54:19,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 00:54:19,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 00:54:19,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 00:54:19,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 00:54:19,171 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 5 states. [2019-01-14 00:54:19,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:54:19,281 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2019-01-14 00:54:19,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 00:54:19,283 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-01-14 00:54:19,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:54:19,284 INFO L225 Difference]: With dead ends: 57 [2019-01-14 00:54:19,285 INFO L226 Difference]: Without dead ends: 57 [2019-01-14 00:54:19,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-14 00:54:19,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-14 00:54:19,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2019-01-14 00:54:19,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-14 00:54:19,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2019-01-14 00:54:19,293 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 17 [2019-01-14 00:54:19,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:54:19,293 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2019-01-14 00:54:19,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 00:54:19,294 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2019-01-14 00:54:19,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 00:54:19,295 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:54:19,295 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:54:19,295 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION]=== [2019-01-14 00:54:19,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:54:19,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1561801763, now seen corresponding path program 1 times [2019-01-14 00:54:19,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:54:19,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:54:19,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:54:19,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:54:19,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:54:19,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:54:19,454 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:54:19,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:54:19,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 00:54:19,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 00:54:19,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 00:54:19,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:54:19,456 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 6 states. [2019-01-14 00:54:19,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:54:19,718 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2019-01-14 00:54:19,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 00:54:19,719 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-01-14 00:54:19,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:54:19,721 INFO L225 Difference]: With dead ends: 65 [2019-01-14 00:54:19,721 INFO L226 Difference]: Without dead ends: 65 [2019-01-14 00:54:19,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-14 00:54:19,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-14 00:54:19,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 52. [2019-01-14 00:54:19,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-14 00:54:19,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2019-01-14 00:54:19,728 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 20 [2019-01-14 00:54:19,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:54:19,728 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2019-01-14 00:54:19,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 00:54:19,729 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2019-01-14 00:54:19,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 00:54:19,730 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:54:19,730 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:54:19,730 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION]=== [2019-01-14 00:54:19,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:54:19,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1561801762, now seen corresponding path program 1 times [2019-01-14 00:54:19,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:54:19,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:54:19,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:54:19,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:54:19,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:54:19,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:54:19,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:54:19,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:54:19,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 00:54:19,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 00:54:19,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 00:54:19,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:54:19,897 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 6 states. [2019-01-14 00:54:20,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:54:20,252 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2019-01-14 00:54:20,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 00:54:20,253 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-01-14 00:54:20,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:54:20,254 INFO L225 Difference]: With dead ends: 61 [2019-01-14 00:54:20,255 INFO L226 Difference]: Without dead ends: 61 [2019-01-14 00:54:20,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-01-14 00:54:20,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-14 00:54:20,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 42. [2019-01-14 00:54:20,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-14 00:54:20,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2019-01-14 00:54:20,260 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 20 [2019-01-14 00:54:20,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:54:20,261 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2019-01-14 00:54:20,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 00:54:20,261 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2019-01-14 00:54:20,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 00:54:20,262 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:54:20,262 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:54:20,262 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION]=== [2019-01-14 00:54:20,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:54:20,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1699550851, now seen corresponding path program 1 times [2019-01-14 00:54:20,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:54:20,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:54:20,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:54:20,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:54:20,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:54:20,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:54:20,617 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:54:20,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:54:20,617 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:54:20,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:54:20,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:54:20,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:54:20,822 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 11 treesize of output 8 [2019-01-14 00:54:20,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 00:54:20,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:54:20,828 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:54:20,847 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 11 treesize of output 8 [2019-01-14 00:54:20,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 00:54:20,853 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:54:20,855 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:54:20,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:54:20,869 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2019-01-14 00:54:20,951 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 15 treesize of output 11 [2019-01-14 00:54:20,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, 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 3 [2019-01-14 00:54:20,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:54:20,961 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:54:20,973 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 15 treesize of output 11 [2019-01-14 00:54:20,976 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 11 treesize of output 3 [2019-01-14 00:54:20,976 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:54:20,978 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:54:20,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:54:20,987 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-01-14 00:54:21,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:54:21,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:54:21,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 11 [2019-01-14 00:54:21,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 00:54:21,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 00:54:21,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-01-14 00:54:21,024 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 11 states. [2019-01-14 00:54:21,309 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 23 [2019-01-14 00:54:21,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:54:21,446 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2019-01-14 00:54:21,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 00:54:21,447 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-01-14 00:54:21,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:54:21,448 INFO L225 Difference]: With dead ends: 57 [2019-01-14 00:54:21,449 INFO L226 Difference]: Without dead ends: 57 [2019-01-14 00:54:21,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 6 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-01-14 00:54:21,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-14 00:54:21,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 46. [2019-01-14 00:54:21,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-14 00:54:21,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2019-01-14 00:54:21,455 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 21 [2019-01-14 00:54:21,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:54:21,455 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2019-01-14 00:54:21,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 00:54:21,455 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2019-01-14 00:54:21,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-14 00:54:21,456 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:54:21,456 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:54:21,457 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION]=== [2019-01-14 00:54:21,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:54:21,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1146467520, now seen corresponding path program 1 times [2019-01-14 00:54:21,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:54:21,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:54:21,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:54:21,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:54:21,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:54:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 00:54:21,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 00:54:21,511 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-14 00:54:21,524 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-01-14 00:54:21,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 12:54:21 BoogieIcfgContainer [2019-01-14 00:54:21,540 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 00:54:21,540 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 00:54:21,541 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 00:54:21,541 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 00:54:21,541 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 12:54:17" (3/4) ... [2019-01-14 00:54:21,544 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-14 00:54:21,548 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-01-14 00:54:21,617 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 00:54:21,617 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 00:54:21,619 INFO L168 Benchmark]: Toolchain (without parser) took 6031.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 952.7 MB in the beginning and 829.4 MB in the end (delta: 123.3 MB). Peak memory consumption was 265.9 MB. Max. memory is 11.5 GB. [2019-01-14 00:54:21,620 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 00:54:21,621 INFO L168 Benchmark]: CACSL2BoogieTranslator took 574.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -171.3 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. [2019-01-14 00:54:21,622 INFO L168 Benchmark]: Boogie Preprocessor took 61.02 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 00:54:21,622 INFO L168 Benchmark]: RCFGBuilder took 784.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 11.5 GB. [2019-01-14 00:54:21,623 INFO L168 Benchmark]: TraceAbstraction took 4528.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 836.0 MB in the end (delta: 241.8 MB). Peak memory consumption was 241.8 MB. Max. memory is 11.5 GB. [2019-01-14 00:54:21,627 INFO L168 Benchmark]: Witness Printer took 76.79 ms. Allocated memory is still 1.2 GB. Free memory was 836.0 MB in the beginning and 829.4 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-14 00:54:21,635 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.17 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 574.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -171.3 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 61.02 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 784.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4528.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 836.0 MB in the end (delta: 241.8 MB). Peak memory consumption was 241.8 MB. Max. memory is 11.5 GB. * Witness Printer took 76.79 ms. Allocated memory is still 1.2 GB. Free memory was 836.0 MB in the beginning and 829.4 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 626]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L627] List a = (List) malloc(sizeof(struct node)); VAL [a={3:0}, malloc(sizeof(struct node))={3:0}] [L628] COND FALSE !(a == 0) VAL [a={3:0}, malloc(sizeof(struct node))={3:0}] [L629] List t; [L630] List p = a; VAL [a={3:0}, malloc(sizeof(struct node))={3:0}, p={3:0}] [L631] a->h = 2 VAL [a={3:0}, malloc(sizeof(struct node))={3:0}, p={3:0}] [L632] COND FALSE !(__VERIFIER_nondet_int()) [L639] p->h = 2 VAL [a={3:0}, malloc(sizeof(struct node))={3:0}, p={3:0}] [L640] p->n = 0 VAL [a={3:0}, malloc(sizeof(struct node))={3:0}, p={3:0}] [L641] p = a VAL [a={3:0}, malloc(sizeof(struct node))={3:0}, p={3:0}] [L642] COND TRUE p!=0 VAL [a={3:0}, malloc(sizeof(struct node))={3:0}, p={3:0}] [L643] EXPR p->h VAL [a={3:0}, malloc(sizeof(struct node))={3:0}, p={3:0}, p->h=2] [L643] COND FALSE !(p->h != 2) [L646] EXPR p->n VAL [a={3:0}, malloc(sizeof(struct node))={3:0}, p={3:0}, p->n={0:0}] [L646] p = p->n [L642] COND FALSE !(p!=0) VAL [a={3:0}, malloc(sizeof(struct node))={3:0}, p={0:0}] [L648] return 0; VAL [\result=0, a={3:0}, malloc(sizeof(struct node))={3:0}, p={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 53 locations, 17 error locations. UNSAFE Result, 4.4s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 2.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 209 SDtfs, 468 SDslu, 297 SDs, 0 SdLazy, 519 SolverSat, 60 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=4, 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, 8 MinimizatonAttempts, 77 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 163 NumberOfCodeBlocks, 163 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 132 ConstructedInterpolants, 0 QuantifiedInterpolants, 12156 SizeOfPredicates, 11 NumberOfNonLiveVariables, 100 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 6/8 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...