./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memcleanup.prp --file /storage/repos/svcomp/c/list-ext-properties/simple-ext_false-unreach-call_false-valid-memcleanup_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) 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/list-ext-properties/simple-ext_false-unreach-call_false-valid-memcleanup_true-termination.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 9becd42a466bdbd2531661a22b57e70854c9d9ea ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 23:02:13,652 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:02:13,654 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:02:13,666 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:02:13,667 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:02:13,668 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:02:13,669 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:02:13,671 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:02:13,673 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:02:13,673 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:02:13,674 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:02:13,675 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:02:13,676 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:02:13,677 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:02:13,678 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:02:13,679 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:02:13,680 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:02:13,682 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:02:13,684 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:02:13,686 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:02:13,687 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:02:13,688 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:02:13,691 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:02:13,691 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:02:13,691 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:02:13,692 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:02:13,693 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:02:13,694 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:02:13,695 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:02:13,696 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:02:13,696 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:02:13,697 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:02:13,697 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:02:13,698 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:02:13,699 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:02:13,700 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:02:13,700 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2018-11-28 23:02:13,733 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:02:13,734 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:02:13,735 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 23:02:13,735 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 23:02:13,735 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:02:13,737 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:02:13,737 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:02:13,738 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:02:13,738 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 23:02:13,738 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:02:13,738 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:02:13,738 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 23:02:13,740 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:02:13,740 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 23:02:13,740 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 23:02:13,740 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 23:02:13,740 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 23:02:13,741 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:02:13,741 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:02:13,741 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:02:13,741 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 23:02:13,741 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 23:02:13,741 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 23:02:13,744 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:02:13,744 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 23:02:13,744 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:02:13,745 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 23:02:13,745 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 -> 9becd42a466bdbd2531661a22b57e70854c9d9ea [2018-11-28 23:02:13,790 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:02:13,810 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:02:13,815 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:02:13,817 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:02:13,817 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:02:13,818 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/list-ext-properties/simple-ext_false-unreach-call_false-valid-memcleanup_true-termination.i [2018-11-28 23:02:13,887 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8b4a6c58/cea6abeda0aa44f198db14306e23a139/FLAGadf75e138 [2018-11-28 23:02:14,428 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:02:14,429 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-ext-properties/simple-ext_false-unreach-call_false-valid-memcleanup_true-termination.i [2018-11-28 23:02:14,443 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8b4a6c58/cea6abeda0aa44f198db14306e23a139/FLAGadf75e138 [2018-11-28 23:02:14,684 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8b4a6c58/cea6abeda0aa44f198db14306e23a139 [2018-11-28 23:02:14,687 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:02:14,689 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 23:02:14,690 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:02:14,690 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:02:14,694 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:02:14,695 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:02:14" (1/1) ... [2018-11-28 23:02:14,698 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2de505c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:14, skipping insertion in model container [2018-11-28 23:02:14,698 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:02:14" (1/1) ... [2018-11-28 23:02:14,709 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:02:14,754 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:02:15,166 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:02:15,178 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:02:15,316 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:02:15,380 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:02:15,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:15 WrapperNode [2018-11-28 23:02:15,382 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:02:15,383 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:02:15,383 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:02:15,383 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:02:15,395 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:15" (1/1) ... [2018-11-28 23:02:15,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:15" (1/1) ... [2018-11-28 23:02:15,414 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:15" (1/1) ... [2018-11-28 23:02:15,414 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:15" (1/1) ... [2018-11-28 23:02:15,431 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:15" (1/1) ... [2018-11-28 23:02:15,441 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:15" (1/1) ... [2018-11-28 23:02:15,450 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:15" (1/1) ... [2018-11-28 23:02:15,459 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:02:15,462 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:02:15,462 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:02:15,462 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:02:15,463 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:15" (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 23:02:15,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 23:02:15,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:02:15,523 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-11-28 23:02:15,523 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 23:02:15,524 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-28 23:02:15,524 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-28 23:02:15,524 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-28 23:02:15,524 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-28 23:02:15,524 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-28 23:02:15,525 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-28 23:02:15,525 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-28 23:02:15,525 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-28 23:02:15,525 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-28 23:02:15,525 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-28 23:02:15,526 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-28 23:02:15,526 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-28 23:02:15,526 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-28 23:02:15,526 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-28 23:02:15,526 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-28 23:02:15,526 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-28 23:02:15,527 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-28 23:02:15,527 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-28 23:02:15,527 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-28 23:02:15,527 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-28 23:02:15,527 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-28 23:02:15,527 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-28 23:02:15,528 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-28 23:02:15,529 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-28 23:02:15,529 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-28 23:02:15,529 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-28 23:02:15,529 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-28 23:02:15,529 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-28 23:02:15,530 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-28 23:02:15,530 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-28 23:02:15,530 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-28 23:02:15,530 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-28 23:02:15,530 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-28 23:02:15,530 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-28 23:02:15,532 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-28 23:02:15,532 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-28 23:02:15,532 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-28 23:02:15,533 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-28 23:02:15,533 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-28 23:02:15,533 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-28 23:02:15,533 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-28 23:02:15,533 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-28 23:02:15,533 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-28 23:02:15,533 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-28 23:02:15,535 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-28 23:02:15,535 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-28 23:02:15,535 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-28 23:02:15,535 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-28 23:02:15,535 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-28 23:02:15,536 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-28 23:02:15,536 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-28 23:02:15,536 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-28 23:02:15,537 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-28 23:02:15,537 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-28 23:02:15,537 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-28 23:02:15,537 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-28 23:02:15,537 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-28 23:02:15,537 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-28 23:02:15,538 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-28 23:02:15,538 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-28 23:02:15,538 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-28 23:02:15,538 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-28 23:02:15,538 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-28 23:02:15,538 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-28 23:02:15,538 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-28 23:02:15,538 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-28 23:02:15,540 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-11-28 23:02:15,541 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-28 23:02:15,541 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-28 23:02:15,541 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-28 23:02:15,541 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-28 23:02:15,541 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-28 23:02:15,541 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-28 23:02:15,541 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-28 23:02:15,542 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-28 23:02:15,543 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-28 23:02:15,543 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-28 23:02:15,543 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-28 23:02:15,543 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-28 23:02:15,544 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-28 23:02:15,544 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-28 23:02:15,544 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-28 23:02:15,544 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-28 23:02:15,544 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-28 23:02:15,544 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-28 23:02:15,544 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-28 23:02:15,545 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-28 23:02:15,545 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-28 23:02:15,545 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-28 23:02:15,545 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-28 23:02:15,545 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-28 23:02:15,545 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-28 23:02:15,545 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-28 23:02:15,547 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-28 23:02:15,547 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-28 23:02:15,547 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-28 23:02:15,548 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-28 23:02:15,548 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-28 23:02:15,548 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-28 23:02:15,548 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-28 23:02:15,548 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-28 23:02:15,548 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-28 23:02:15,548 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-28 23:02:15,548 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-11-28 23:02:15,550 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 23:02:15,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:02:15,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:02:15,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 23:02:15,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 23:02:15,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:02:15,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:02:15,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 23:02:15,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:02:16,454 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:02:16,454 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-28 23:02:16,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:02:16 BoogieIcfgContainer [2018-11-28 23:02:16,455 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:02:16,456 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 23:02:16,456 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 23:02:16,460 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 23:02:16,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:02:14" (1/3) ... [2018-11-28 23:02:16,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56c436f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:02:16, skipping insertion in model container [2018-11-28 23:02:16,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:15" (2/3) ... [2018-11-28 23:02:16,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56c436f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:02:16, skipping insertion in model container [2018-11-28 23:02:16,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:02:16" (3/3) ... [2018-11-28 23:02:16,464 INFO L112 eAbstractionObserver]: Analyzing ICFG simple-ext_false-unreach-call_false-valid-memcleanup_true-termination.i [2018-11-28 23:02:16,474 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 23:02:16,484 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-11-28 23:02:16,504 INFO L257 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2018-11-28 23:02:16,534 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:02:16,535 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 23:02:16,535 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 23:02:16,536 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 23:02:16,537 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:02:16,537 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:02:16,537 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 23:02:16,537 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:02:16,538 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 23:02:16,564 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-11-28 23:02:16,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 23:02:16,584 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:16,585 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:16,588 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr5REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 23:02:16,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:16,599 INFO L82 PathProgramCache]: Analyzing trace with hash -409997035, now seen corresponding path program 1 times [2018-11-28 23:02:16,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:16,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:16,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:16,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:16,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:16,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:16,790 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 23:02:16,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:02:16,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:02:16,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-28 23:02:16,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 23:02:16,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 23:02:16,820 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 2 states. [2018-11-28 23:02:16,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:16,845 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2018-11-28 23:02:16,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 23:02:16,847 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-28 23:02:16,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:16,858 INFO L225 Difference]: With dead ends: 60 [2018-11-28 23:02:16,858 INFO L226 Difference]: Without dead ends: 52 [2018-11-28 23:02:16,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 23:02:16,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-28 23:02:16,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-11-28 23:02:16,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-28 23:02:16,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-11-28 23:02:16,907 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 10 [2018-11-28 23:02:16,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:16,907 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-11-28 23:02:16,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-28 23:02:16,908 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-11-28 23:02:16,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-28 23:02:16,908 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:16,909 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:16,909 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr5REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 23:02:16,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:16,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1128888238, now seen corresponding path program 1 times [2018-11-28 23:02:16,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:16,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:16,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:16,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:16,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:16,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:17,050 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 23:02:17,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:02:17,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:02:17,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 23:02:17,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 23:02:17,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:02:17,054 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 4 states. [2018-11-28 23:02:17,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:17,546 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2018-11-28 23:02:17,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:02:17,547 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-28 23:02:17,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:17,548 INFO L225 Difference]: With dead ends: 68 [2018-11-28 23:02:17,548 INFO L226 Difference]: Without dead ends: 68 [2018-11-28 23:02:17,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 23:02:17,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-28 23:02:17,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 56. [2018-11-28 23:02:17,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-28 23:02:17,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2018-11-28 23:02:17,558 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 12 [2018-11-28 23:02:17,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:17,558 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2018-11-28 23:02:17,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 23:02:17,558 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2018-11-28 23:02:17,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-28 23:02:17,559 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:17,559 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:17,559 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr5REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 23:02:17,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:17,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1128888239, now seen corresponding path program 1 times [2018-11-28 23:02:17,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:17,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:17,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:17,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:17,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:17,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:17,663 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 23:02:17,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:02:17,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:02:17,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 23:02:17,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 23:02:17,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:02:17,664 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand 4 states. [2018-11-28 23:02:18,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:18,106 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2018-11-28 23:02:18,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:02:18,107 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-28 23:02:18,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:18,109 INFO L225 Difference]: With dead ends: 73 [2018-11-28 23:02:18,110 INFO L226 Difference]: Without dead ends: 73 [2018-11-28 23:02:18,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 23:02:18,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-28 23:02:18,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 65. [2018-11-28 23:02:18,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-28 23:02:18,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2018-11-28 23:02:18,118 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 12 [2018-11-28 23:02:18,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:18,119 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2018-11-28 23:02:18,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 23:02:18,119 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2018-11-28 23:02:18,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-28 23:02:18,120 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:18,120 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:18,120 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr5REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 23:02:18,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:18,121 INFO L82 PathProgramCache]: Analyzing trace with hash 41150587, now seen corresponding path program 1 times [2018-11-28 23:02:18,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:18,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:18,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:18,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:18,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:18,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:18,187 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 23:02:18,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:02:18,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 23:02:18,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 23:02:18,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 23:02:18,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:02:18,191 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand 4 states. [2018-11-28 23:02:18,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:18,618 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2018-11-28 23:02:18,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:02:18,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-11-28 23:02:18,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:18,622 INFO L225 Difference]: With dead ends: 69 [2018-11-28 23:02:18,622 INFO L226 Difference]: Without dead ends: 69 [2018-11-28 23:02:18,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:02:18,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-28 23:02:18,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2018-11-28 23:02:18,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-28 23:02:18,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-11-28 23:02:18,630 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 19 [2018-11-28 23:02:18,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:18,631 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2018-11-28 23:02:18,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 23:02:18,631 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-11-28 23:02:18,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 23:02:18,632 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:18,632 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] [2018-11-28 23:02:18,633 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr5REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 23:02:18,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:18,634 INFO L82 PathProgramCache]: Analyzing trace with hash 2135056834, now seen corresponding path program 1 times [2018-11-28 23:02:18,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:18,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:18,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:18,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:18,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:18,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:18,838 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:18,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:02:18,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 23:02:18,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 23:02:18,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 23:02:18,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 23:02:18,840 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 7 states. [2018-11-28 23:02:19,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:19,151 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2018-11-28 23:02:19,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 23:02:19,152 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-11-28 23:02:19,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:19,153 INFO L225 Difference]: With dead ends: 80 [2018-11-28 23:02:19,154 INFO L226 Difference]: Without dead ends: 74 [2018-11-28 23:02:19,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-28 23:02:19,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-28 23:02:19,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 63. [2018-11-28 23:02:19,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-28 23:02:19,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2018-11-28 23:02:19,160 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 21 [2018-11-28 23:02:19,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:19,161 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-11-28 23:02:19,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 23:02:19,161 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-11-28 23:02:19,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 23:02:19,162 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:19,162 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:19,162 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr5REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 23:02:19,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:19,163 INFO L82 PathProgramCache]: Analyzing trace with hash -735893650, now seen corresponding path program 1 times [2018-11-28 23:02:19,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:19,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:19,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:19,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:19,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:19,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:19,266 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:19,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:02:19,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 23:02:19,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 23:02:19,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 23:02:19,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:02:19,269 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 6 states. [2018-11-28 23:02:19,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:19,468 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2018-11-28 23:02:19,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 23:02:19,470 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-28 23:02:19,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:19,471 INFO L225 Difference]: With dead ends: 62 [2018-11-28 23:02:19,471 INFO L226 Difference]: Without dead ends: 62 [2018-11-28 23:02:19,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-28 23:02:19,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-28 23:02:19,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-11-28 23:02:19,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-28 23:02:19,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-11-28 23:02:19,478 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 21 [2018-11-28 23:02:19,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:19,479 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-11-28 23:02:19,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 23:02:19,479 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-11-28 23:02:19,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 23:02:19,480 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:19,480 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:19,480 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr5REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 23:02:19,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:19,481 INFO L82 PathProgramCache]: Analyzing trace with hash -735893649, now seen corresponding path program 1 times [2018-11-28 23:02:19,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:19,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:19,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:19,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:19,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:19,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:19,629 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:19,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:02:19,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 23:02:19,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 23:02:19,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 23:02:19,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:02:19,630 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 6 states. [2018-11-28 23:02:20,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:20,098 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-11-28 23:02:20,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 23:02:20,099 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-28 23:02:20,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:20,100 INFO L225 Difference]: With dead ends: 57 [2018-11-28 23:02:20,101 INFO L226 Difference]: Without dead ends: 57 [2018-11-28 23:02:20,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-11-28 23:02:20,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-28 23:02:20,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2018-11-28 23:02:20,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-28 23:02:20,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-11-28 23:02:20,106 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 21 [2018-11-28 23:02:20,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:20,106 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-11-28 23:02:20,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 23:02:20,107 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-28 23:02:20,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 23:02:20,107 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:20,108 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:20,108 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr5REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 23:02:20,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:20,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1039297026, now seen corresponding path program 1 times [2018-11-28 23:02:20,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:20,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:20,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:20,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:20,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:20,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:20,384 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:20,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:20,385 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 23:02:20,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:20,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:20,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:20,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 23:02:20,528 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:20,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:20,608 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 23:02:20,889 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 [2018-11-28 23:02:20,913 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 23:02:20,914 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:20,933 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:20,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:20,949 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-11-28 23:02:20,990 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:20,991 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:20,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 23:02:20,993 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:21,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:21,008 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:24 [2018-11-28 23:02:21,049 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 13 treesize of output 10 [2018-11-28 23:02:21,053 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 23:02:21,053 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:21,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:21,119 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 27 treesize of output 22 [2018-11-28 23:02:21,128 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:21,130 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 22 treesize of output 14 [2018-11-28 23:02:21,131 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:21,136 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:21,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:21,154 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:30 [2018-11-28 23:02:21,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-28 23:02:21,209 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 16 treesize of output 4 [2018-11-28 23:02:21,209 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:21,215 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:21,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:21,228 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:18 [2018-11-28 23:02:21,327 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 19 treesize of output 20 [2018-11-28 23:02:21,333 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 23:02:21,333 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:21,340 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:21,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:21,351 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:18 [2018-11-28 23:02:21,362 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 27 treesize of output 28 [2018-11-28 23:02:21,368 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 16 treesize of output 1 [2018-11-28 23:02:21,368 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:21,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:21,387 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 23:02:21,387 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:14 [2018-11-28 23:02:21,604 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 [2018-11-28 23:02:21,608 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 [2018-11-28 23:02:21,608 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:21,609 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:21,616 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 23:02:21,617 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:3 [2018-11-28 23:02:21,620 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:21,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:02:21,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2018-11-28 23:02:21,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-28 23:02:21,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-28 23:02:21,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2018-11-28 23:02:21,641 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 20 states. [2018-11-28 23:02:22,634 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-11-28 23:02:23,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:23,123 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2018-11-28 23:02:23,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 23:02:23,125 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2018-11-28 23:02:23,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:23,126 INFO L225 Difference]: With dead ends: 79 [2018-11-28 23:02:23,126 INFO L226 Difference]: Without dead ends: 73 [2018-11-28 23:02:23,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2018-11-28 23:02:23,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-28 23:02:23,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 60. [2018-11-28 23:02:23,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-28 23:02:23,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-11-28 23:02:23,136 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 30 [2018-11-28 23:02:23,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:23,137 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-11-28 23:02:23,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-28 23:02:23,137 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-11-28 23:02:23,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-28 23:02:23,141 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:23,141 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:23,141 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr5REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 23:02:23,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:23,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1663543746, now seen corresponding path program 2 times [2018-11-28 23:02:23,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:23,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:23,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:23,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:23,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:23,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:23,936 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:23,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:23,936 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 23:02:23,956 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:02:23,999 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 23:02:23,999 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:02:24,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:24,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 23:02:24,022 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:24,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:24,029 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 23:02:24,157 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:24,158 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:24,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-28 23:02:24,159 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:24,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:24,176 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-11-28 23:02:24,224 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 13 treesize of output 10 [2018-11-28 23:02:24,243 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 23:02:24,244 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:24,247 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:24,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:24,262 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:36 [2018-11-28 23:02:24,433 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:24,437 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 46 treesize of output 47 [2018-11-28 23:02:24,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-11-28 23:02:24,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:24,450 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:24,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:24,459 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:54, output treesize:39 [2018-11-28 23:02:24,467 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:24,468 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:24,469 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:24,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-11-28 23:02:24,471 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:24,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:24,478 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:37 [2018-11-28 23:02:24,519 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:24,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 44 [2018-11-28 23:02:24,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 23:02:24,528 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:24,537 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:24,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:24,577 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:54 [2018-11-28 23:02:24,922 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:24,924 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:24,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 92 [2018-11-28 23:02:24,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-11-28 23:02:24,949 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:24,970 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:24,987 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 23:02:24,987 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:93, output treesize:66 [2018-11-28 23:02:25,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 76 [2018-11-28 23:02:25,108 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 22 treesize of output 21 [2018-11-28 23:02:25,108 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:25,132 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:25,145 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 23:02:25,146 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:100, output treesize:84 [2018-11-28 23:02:25,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 51 [2018-11-28 23:02:25,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-11-28 23:02:25,283 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:25,293 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 19 treesize of output 10 [2018-11-28 23:02:25,294 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:25,303 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 7 treesize of output 1 [2018-11-28 23:02:25,304 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:25,308 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:25,312 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 23:02:25,312 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:76, output treesize:5 [2018-11-28 23:02:25,372 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:25,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:02:25,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2018-11-28 23:02:25,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-28 23:02:25,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-28 23:02:25,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=726, Unknown=0, NotChecked=0, Total=812 [2018-11-28 23:02:25,402 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 29 states. [2018-11-28 23:02:26,767 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2018-11-28 23:02:28,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:28,067 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2018-11-28 23:02:28,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-28 23:02:28,068 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 39 [2018-11-28 23:02:28,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:28,069 INFO L225 Difference]: With dead ends: 56 [2018-11-28 23:02:28,069 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 23:02:28,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=394, Invalid=2156, Unknown=0, NotChecked=0, Total=2550 [2018-11-28 23:02:28,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 23:02:28,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 23:02:28,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 23:02:28,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 23:02:28,072 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2018-11-28 23:02:28,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:28,072 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:02:28,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-28 23:02:28,072 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:02:28,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 23:02:28,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 11:02:28 BoogieIcfgContainer [2018-11-28 23:02:28,077 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 23:02:28,078 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:02:28,078 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:02:28,078 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:02:28,078 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:02:16" (3/4) ... [2018-11-28 23:02:28,084 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 23:02:28,090 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 23:02:28,090 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2018-11-28 23:02:28,090 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 23:02:28,095 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-11-28 23:02:28,096 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-28 23:02:28,096 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 23:02:28,154 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 23:02:28,154 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:02:28,155 INFO L168 Benchmark]: Toolchain (without parser) took 13467.37 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 299.9 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -167.2 MB). Peak memory consumption was 132.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:02:28,156 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 23:02:28,158 INFO L168 Benchmark]: CACSL2BoogieTranslator took 692.45 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -139.6 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. [2018-11-28 23:02:28,158 INFO L168 Benchmark]: Boogie Preprocessor took 78.82 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:02:28,159 INFO L168 Benchmark]: RCFGBuilder took 993.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 11.5 GB. [2018-11-28 23:02:28,159 INFO L168 Benchmark]: TraceAbstraction took 11621.37 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 187.2 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -73.6 MB). Peak memory consumption was 113.6 MB. Max. memory is 11.5 GB. [2018-11-28 23:02:28,162 INFO L168 Benchmark]: Witness Printer took 76.69 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:02:28,165 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 692.45 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -139.6 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 78.82 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 993.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11621.37 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 187.2 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -73.6 MB). Peak memory consumption was 113.6 MB. Max. memory is 11.5 GB. * Witness Printer took 76.69 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 638]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 655]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 638]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 655]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 637]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 649]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 637]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 656]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 634]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 649]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 656]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 646]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 634]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 646]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 642]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 642]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 641]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 641]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 627]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 19 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 62 locations, 19 error locations. SAFE Result, 11.5s OverallTime, 9 OverallIterations, 3 TraceHistogramMax, 6.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 300 SDtfs, 590 SDslu, 882 SDs, 0 SdLazy, 1418 SolverSat, 200 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 170 GetRequests, 60 SyntacticMatches, 4 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 55 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 254 NumberOfCodeBlocks, 254 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 243 ConstructedInterpolants, 11 QuantifiedInterpolants, 96386 SizeOfPredicates, 33 NumberOfNonLiveVariables, 338 ConjunctsInSsa, 77 ConjunctsInUnsatCore, 11 InterpolantComputations, 7 PerfectInterpolantSequences, 14/52 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...