./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 cbd82567 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.23-cbd8256-m [2018-11-28 11:50:17,344 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 11:50:17,346 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 11:50:17,361 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 11:50:17,362 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 11:50:17,363 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 11:50:17,364 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 11:50:17,365 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 11:50:17,367 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 11:50:17,369 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 11:50:17,370 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 11:50:17,370 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 11:50:17,372 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 11:50:17,373 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 11:50:17,375 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 11:50:17,375 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 11:50:17,376 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 11:50:17,378 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 11:50:17,380 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 11:50:17,382 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 11:50:17,383 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 11:50:17,384 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 11:50:17,387 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 11:50:17,387 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 11:50:17,388 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 11:50:17,389 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 11:50:17,390 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 11:50:17,391 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 11:50:17,392 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 11:50:17,393 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 11:50:17,393 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 11:50:17,394 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 11:50:17,394 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 11:50:17,395 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 11:50:17,396 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 11:50:17,396 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 11:50:17,397 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2018-11-28 11:50:17,412 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 11:50:17,412 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 11:50:17,413 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 11:50:17,413 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 11:50:17,414 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 11:50:17,414 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 11:50:17,414 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 11:50:17,415 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 11:50:17,416 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 11:50:17,416 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 11:50:17,416 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 11:50:17,416 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 11:50:17,416 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 11:50:17,416 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 11:50:17,417 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 11:50:17,417 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 11:50:17,417 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 11:50:17,417 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 11:50:17,417 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 11:50:17,417 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 11:50:17,418 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 11:50:17,419 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 11:50:17,419 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 11:50:17,419 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 11:50:17,420 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 11:50:17,420 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 11:50:17,420 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 11:50:17,420 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 11:50:17,467 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 11:50:17,479 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 11:50:17,483 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 11:50:17,485 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 11:50:17,485 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 11:50:17,486 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 11:50:17,545 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7522b160/fe2d8bd2109640ec9698df8276215538/FLAG8bded159e [2018-11-28 11:50:18,075 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 11:50:18,076 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 11:50:18,093 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7522b160/fe2d8bd2109640ec9698df8276215538/FLAG8bded159e [2018-11-28 11:50:18,366 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7522b160/fe2d8bd2109640ec9698df8276215538 [2018-11-28 11:50:18,371 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 11:50:18,376 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 11:50:18,379 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 11:50:18,382 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 11:50:18,386 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 11:50:18,387 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:50:18" (1/1) ... [2018-11-28 11:50:18,392 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a8795c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:50:18, skipping insertion in model container [2018-11-28 11:50:18,393 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:50:18" (1/1) ... [2018-11-28 11:50:18,402 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 11:50:18,458 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 11:50:18,857 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:50:18,872 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 11:50:19,018 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:50:19,084 INFO L195 MainTranslator]: Completed translation [2018-11-28 11:50:19,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:50:19 WrapperNode [2018-11-28 11:50:19,085 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 11:50:19,086 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 11:50:19,086 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 11:50:19,086 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 11:50:19,101 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:50:19" (1/1) ... [2018-11-28 11:50:19,101 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:50:19" (1/1) ... [2018-11-28 11:50:19,118 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:50:19" (1/1) ... [2018-11-28 11:50:19,118 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:50:19" (1/1) ... [2018-11-28 11:50:19,146 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:50:19" (1/1) ... [2018-11-28 11:50:19,151 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:50:19" (1/1) ... [2018-11-28 11:50:19,155 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:50:19" (1/1) ... [2018-11-28 11:50:19,161 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 11:50:19,161 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 11:50:19,162 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 11:50:19,162 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 11:50:19,163 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:50:19" (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 11:50:19,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 11:50:19,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 11:50:19,230 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-11-28 11:50:19,231 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 11:50:19,231 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-28 11:50:19,231 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-28 11:50:19,232 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-28 11:50:19,232 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-28 11:50:19,232 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-28 11:50:19,232 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-28 11:50:19,235 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-28 11:50:19,235 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-28 11:50:19,236 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-28 11:50:19,236 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-28 11:50:19,236 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-28 11:50:19,236 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-28 11:50:19,236 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-28 11:50:19,236 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-28 11:50:19,237 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-28 11:50:19,237 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-28 11:50:19,237 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-28 11:50:19,237 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-28 11:50:19,237 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-28 11:50:19,237 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-28 11:50:19,238 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-28 11:50:19,238 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-28 11:50:19,238 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-28 11:50:19,238 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-28 11:50:19,238 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-28 11:50:19,238 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-28 11:50:19,239 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-28 11:50:19,239 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-28 11:50:19,239 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-28 11:50:19,239 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-28 11:50:19,239 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-28 11:50:19,239 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-28 11:50:19,239 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-28 11:50:19,240 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-28 11:50:19,240 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-28 11:50:19,240 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-28 11:50:19,240 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-28 11:50:19,240 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-28 11:50:19,240 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-28 11:50:19,241 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-28 11:50:19,241 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-28 11:50:19,241 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-28 11:50:19,241 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-28 11:50:19,241 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-28 11:50:19,241 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-28 11:50:19,241 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-28 11:50:19,242 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-28 11:50:19,242 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-28 11:50:19,242 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-28 11:50:19,242 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-28 11:50:19,242 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-28 11:50:19,242 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-28 11:50:19,243 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-28 11:50:19,243 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-28 11:50:19,243 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-28 11:50:19,243 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-28 11:50:19,243 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-28 11:50:19,243 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-28 11:50:19,243 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-28 11:50:19,244 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-28 11:50:19,244 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-28 11:50:19,244 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-28 11:50:19,244 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-28 11:50:19,244 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-28 11:50:19,244 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-28 11:50:19,245 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-28 11:50:19,245 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-11-28 11:50:19,245 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-28 11:50:19,245 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-28 11:50:19,245 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-28 11:50:19,245 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-28 11:50:19,245 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-28 11:50:19,246 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-28 11:50:19,246 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-28 11:50:19,246 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-28 11:50:19,246 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-28 11:50:19,246 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-28 11:50:19,246 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-28 11:50:19,246 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-28 11:50:19,247 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-28 11:50:19,247 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-28 11:50:19,247 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-28 11:50:19,247 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-28 11:50:19,247 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-28 11:50:19,247 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-28 11:50:19,247 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-28 11:50:19,248 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-28 11:50:19,248 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-28 11:50:19,248 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-28 11:50:19,248 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-28 11:50:19,248 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-28 11:50:19,248 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-28 11:50:19,248 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-28 11:50:19,248 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-28 11:50:19,249 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-28 11:50:19,249 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-28 11:50:19,249 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-28 11:50:19,249 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-28 11:50:19,249 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-28 11:50:19,249 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-28 11:50:19,249 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-28 11:50:19,250 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-28 11:50:19,250 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-28 11:50:19,250 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-11-28 11:50:19,250 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 11:50:19,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 11:50:19,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 11:50:19,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 11:50:19,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 11:50:19,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 11:50:19,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 11:50:19,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 11:50:19,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 11:50:20,075 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 11:50:20,075 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-28 11:50:20,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:50:20 BoogieIcfgContainer [2018-11-28 11:50:20,076 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 11:50:20,077 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 11:50:20,077 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 11:50:20,080 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 11:50:20,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:50:18" (1/3) ... [2018-11-28 11:50:20,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31a33dd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:50:20, skipping insertion in model container [2018-11-28 11:50:20,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:50:19" (2/3) ... [2018-11-28 11:50:20,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31a33dd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:50:20, skipping insertion in model container [2018-11-28 11:50:20,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:50:20" (3/3) ... [2018-11-28 11:50:20,084 INFO L112 eAbstractionObserver]: Analyzing ICFG simple-ext_false-unreach-call_false-valid-memcleanup_true-termination.i [2018-11-28 11:50:20,094 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 11:50:20,103 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-11-28 11:50:20,121 INFO L257 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2018-11-28 11:50:20,147 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 11:50:20,148 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 11:50:20,148 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 11:50:20,148 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 11:50:20,149 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 11:50:20,149 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 11:50:20,149 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 11:50:20,149 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 11:50:20,150 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 11:50:20,166 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-11-28 11:50:20,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 11:50:20,176 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:50:20,177 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:50:20,179 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2018-11-28 11:50:20,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:50:20,185 INFO L82 PathProgramCache]: Analyzing trace with hash -409997035, now seen corresponding path program 1 times [2018-11-28 11:50:20,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:50:20,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:50:20,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:20,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:50:20,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:20,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:50:20,320 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 11:50:20,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:50:20,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 11:50:20,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-28 11:50:20,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 11:50:20,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 11:50:20,343 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 2 states. [2018-11-28 11:50:20,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:50:20,363 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2018-11-28 11:50:20,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 11:50:20,365 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-28 11:50:20,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:50:20,374 INFO L225 Difference]: With dead ends: 60 [2018-11-28 11:50:20,374 INFO L226 Difference]: Without dead ends: 52 [2018-11-28 11:50:20,376 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 11:50:20,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-28 11:50:20,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-11-28 11:50:20,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-28 11:50:20,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-11-28 11:50:20,424 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 10 [2018-11-28 11:50:20,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:50:20,425 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-11-28 11:50:20,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-28 11:50:20,425 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-11-28 11:50:20,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-28 11:50:20,426 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:50:20,426 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:50:20,426 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2018-11-28 11:50:20,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:50:20,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1128888238, now seen corresponding path program 1 times [2018-11-28 11:50:20,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:50:20,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:50:20,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:20,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:50:20,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:20,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:50:20,546 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 11:50:20,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:50:20,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:50:20,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:50:20,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:50:20,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:50:20,549 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 4 states. [2018-11-28 11:50:20,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:50:20,988 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2018-11-28 11:50:20,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:50:20,989 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-28 11:50:20,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:50:20,991 INFO L225 Difference]: With dead ends: 68 [2018-11-28 11:50:20,991 INFO L226 Difference]: Without dead ends: 68 [2018-11-28 11:50:20,993 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 11:50:20,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-28 11:50:20,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 56. [2018-11-28 11:50:20,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-28 11:50:21,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2018-11-28 11:50:21,001 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 12 [2018-11-28 11:50:21,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:50:21,002 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2018-11-28 11:50:21,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:50:21,002 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2018-11-28 11:50:21,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-28 11:50:21,002 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:50:21,004 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:50:21,004 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2018-11-28 11:50:21,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:50:21,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1128888239, now seen corresponding path program 1 times [2018-11-28 11:50:21,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:50:21,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:50:21,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:21,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:50:21,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:21,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:50:21,101 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 11:50:21,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:50:21,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:50:21,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:50:21,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:50:21,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:50:21,104 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand 4 states. [2018-11-28 11:50:21,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:50:21,668 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2018-11-28 11:50:21,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:50:21,668 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-28 11:50:21,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:50:21,670 INFO L225 Difference]: With dead ends: 73 [2018-11-28 11:50:21,670 INFO L226 Difference]: Without dead ends: 73 [2018-11-28 11:50:21,671 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 11:50:21,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-28 11:50:21,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 65. [2018-11-28 11:50:21,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-28 11:50:21,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2018-11-28 11:50:21,679 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 12 [2018-11-28 11:50:21,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:50:21,679 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2018-11-28 11:50:21,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:50:21,679 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2018-11-28 11:50:21,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-28 11:50:21,681 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:50:21,681 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 11:50:21,681 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2018-11-28 11:50:21,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:50:21,682 INFO L82 PathProgramCache]: Analyzing trace with hash 41150587, now seen corresponding path program 1 times [2018-11-28 11:50:21,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:50:21,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:50:21,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:21,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:50:21,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:21,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:50:21,754 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 11:50:21,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:50:21,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:50:21,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:50:21,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:50:21,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:50:21,756 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand 4 states. [2018-11-28 11:50:21,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:50:21,915 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2018-11-28 11:50:21,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:50:21,916 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-11-28 11:50:21,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:50:21,918 INFO L225 Difference]: With dead ends: 69 [2018-11-28 11:50:21,918 INFO L226 Difference]: Without dead ends: 69 [2018-11-28 11:50:21,919 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 11:50:21,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-28 11:50:21,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2018-11-28 11:50:21,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-28 11:50:21,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-11-28 11:50:21,925 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 19 [2018-11-28 11:50:21,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:50:21,926 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2018-11-28 11:50:21,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:50:21,926 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-11-28 11:50:21,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 11:50:21,927 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:50:21,927 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 11:50:21,927 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2018-11-28 11:50:21,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:50:21,928 INFO L82 PathProgramCache]: Analyzing trace with hash 2135056834, now seen corresponding path program 1 times [2018-11-28 11:50:21,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:50:21,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:50:21,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:21,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:50:21,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:21,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:50:22,123 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 11:50:22,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:50:22,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 11:50:22,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 11:50:22,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 11:50:22,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:50:22,125 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 7 states. [2018-11-28 11:50:22,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:50:22,427 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2018-11-28 11:50:22,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:50:22,428 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-11-28 11:50:22,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:50:22,429 INFO L225 Difference]: With dead ends: 80 [2018-11-28 11:50:22,430 INFO L226 Difference]: Without dead ends: 74 [2018-11-28 11:50:22,430 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 11:50:22,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-28 11:50:22,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 63. [2018-11-28 11:50:22,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-28 11:50:22,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2018-11-28 11:50:22,436 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 21 [2018-11-28 11:50:22,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:50:22,438 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-11-28 11:50:22,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 11:50:22,438 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-11-28 11:50:22,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 11:50:22,439 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:50:22,440 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 11:50:22,440 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2018-11-28 11:50:22,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:50:22,440 INFO L82 PathProgramCache]: Analyzing trace with hash -735893650, now seen corresponding path program 1 times [2018-11-28 11:50:22,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:50:22,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:50:22,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:22,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:50:22,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:22,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:50:22,540 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 11:50:22,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:50:22,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:50:22,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:50:22,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:50:22,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:50:22,543 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 6 states. [2018-11-28 11:50:22,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:50:22,759 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2018-11-28 11:50:22,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 11:50:22,760 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-28 11:50:22,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:50:22,762 INFO L225 Difference]: With dead ends: 62 [2018-11-28 11:50:22,762 INFO L226 Difference]: Without dead ends: 62 [2018-11-28 11:50:22,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-28 11:50:22,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-28 11:50:22,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-11-28 11:50:22,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-28 11:50:22,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-11-28 11:50:22,769 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 21 [2018-11-28 11:50:22,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:50:22,770 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-11-28 11:50:22,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:50:22,770 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-11-28 11:50:22,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 11:50:22,771 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:50:22,771 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 11:50:22,771 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2018-11-28 11:50:22,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:50:22,773 INFO L82 PathProgramCache]: Analyzing trace with hash -735893649, now seen corresponding path program 1 times [2018-11-28 11:50:22,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:50:22,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:50:22,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:22,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:50:22,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:22,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:50:22,913 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 11:50:22,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:50:22,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:50:22,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:50:22,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:50:22,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:50:22,916 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 6 states. [2018-11-28 11:50:23,243 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-28 11:50:23,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:50:23,327 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-11-28 11:50:23,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 11:50:23,328 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-28 11:50:23,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:50:23,328 INFO L225 Difference]: With dead ends: 57 [2018-11-28 11:50:23,329 INFO L226 Difference]: Without dead ends: 57 [2018-11-28 11:50:23,329 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 11:50:23,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-28 11:50:23,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2018-11-28 11:50:23,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-28 11:50:23,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-11-28 11:50:23,335 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 21 [2018-11-28 11:50:23,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:50:23,337 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-11-28 11:50:23,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:50:23,337 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-28 11:50:23,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 11:50:23,339 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:50:23,339 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 11:50:23,339 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2018-11-28 11:50:23,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:50:23,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1039297026, now seen corresponding path program 1 times [2018-11-28 11:50:23,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:50:23,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:50:23,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:23,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:50:23,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:23,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:50:23,749 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 11:50:23,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:50:23,750 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 11:50:23,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:50:23,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:50:23,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:50:23,878 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 11:50:23,880 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:23,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:23,888 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 11:50:24,016 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 11:50:24,027 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 11:50:24,027 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:24,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:24,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:24,047 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-11-28 11:50:24,082 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:50:24,085 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:50:24,086 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 11:50:24,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:24,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:24,143 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:24 [2018-11-28 11:50:24,194 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 11:50:24,198 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 11:50:24,199 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:24,203 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:24,265 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 11:50:24,288 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:50:24,290 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 11:50:24,291 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:24,295 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:24,314 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 11:50:24,315 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:30 [2018-11-28 11:50:24,377 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 11:50:24,381 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 11:50:24,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:24,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:24,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:24,403 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:18 [2018-11-28 11:50:24,527 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 11:50:24,531 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 11:50:24,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:24,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:24,552 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 11:50:24,553 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:18 [2018-11-28 11:50:24,564 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 11:50:24,569 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 11:50:24,569 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:24,577 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:24,586 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 11:50:24,587 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:14 [2018-11-28 11:50:24,794 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 11:50:24,797 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 11:50:24,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:24,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:24,806 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 11:50:24,809 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:3 [2018-11-28 11:50:24,813 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 11:50:24,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:50:24,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2018-11-28 11:50:24,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-28 11:50:24,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-28 11:50:24,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2018-11-28 11:50:24,834 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 20 states. [2018-11-28 11:50:25,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:50:25,798 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2018-11-28 11:50:25,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 11:50:25,799 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2018-11-28 11:50:25,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:50:25,800 INFO L225 Difference]: With dead ends: 79 [2018-11-28 11:50:25,801 INFO L226 Difference]: Without dead ends: 73 [2018-11-28 11:50:25,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2018-11-28 11:50:25,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-28 11:50:25,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 60. [2018-11-28 11:50:25,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-28 11:50:25,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-11-28 11:50:25,807 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 30 [2018-11-28 11:50:25,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:50:25,809 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-11-28 11:50:25,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-28 11:50:25,809 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-11-28 11:50:25,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-28 11:50:25,810 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:50:25,810 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 11:50:25,810 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2018-11-28 11:50:25,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:50:25,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1663543746, now seen corresponding path program 2 times [2018-11-28 11:50:25,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:50:25,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:50:25,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:25,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:50:25,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:50:25,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:50:26,627 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 11:50:26,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:50:26,627 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 11:50:26,638 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 11:50:26,672 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 11:50:26,672 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:50:26,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:50:26,692 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 11:50:26,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:26,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:26,697 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 11:50:26,821 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:50:26,824 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:50:26,825 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 11:50:26,825 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:26,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:26,838 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-11-28 11:50:26,892 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 11:50:26,894 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 11:50:26,895 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:26,898 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:26,914 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 11:50:26,914 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:36 [2018-11-28 11:50:27,091 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:50:27,100 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 11:50:27,103 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 11:50:27,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:27,113 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:27,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:27,125 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:54, output treesize:39 [2018-11-28 11:50:27,131 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:50:27,134 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:50:27,135 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:50:27,138 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 11:50:27,139 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:27,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:27,150 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:37 [2018-11-28 11:50:27,189 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:50:27,195 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 11:50:27,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 11:50:27,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:27,212 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:27,255 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 11:50:27,255 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:54 [2018-11-28 11:50:27,515 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:50:27,520 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:50:27,538 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 11:50:27,546 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 11:50:27,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:27,565 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:27,579 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 11:50:27,580 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:93, output treesize:66 [2018-11-28 11:50:27,643 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 11:50:27,664 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 11:50:27,665 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:27,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:27,698 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 11:50:27,698 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:100, output treesize:84 [2018-11-28 11:50:27,821 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 11:50:27,829 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 11:50:27,830 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:27,839 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 11:50:27,840 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:27,847 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 11:50:27,848 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:50:27,851 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:50:27,856 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 11:50:27,856 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:76, output treesize:5 [2018-11-28 11:50:27,912 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 11:50:27,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:50:27,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2018-11-28 11:50:27,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-28 11:50:27,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-28 11:50:27,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=726, Unknown=0, NotChecked=0, Total=812 [2018-11-28 11:50:27,943 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 29 states. [2018-11-28 11:50:29,284 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2018-11-28 11:50:30,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:50:30,627 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2018-11-28 11:50:30,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-28 11:50:30,628 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 39 [2018-11-28 11:50:30,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:50:30,629 INFO L225 Difference]: With dead ends: 56 [2018-11-28 11:50:30,629 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 11:50:30,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=394, Invalid=2156, Unknown=0, NotChecked=0, Total=2550 [2018-11-28 11:50:30,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 11:50:30,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 11:50:30,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 11:50:30,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 11:50:30,633 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2018-11-28 11:50:30,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:50:30,633 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:50:30,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-28 11:50:30,636 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 11:50:30,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 11:50:30,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 11:50:30 BoogieIcfgContainer [2018-11-28 11:50:30,642 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 11:50:30,642 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 11:50:30,643 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 11:50:30,643 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 11:50:30,643 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:50:20" (3/4) ... [2018-11-28 11:50:30,648 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 11:50:30,654 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 11:50:30,655 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2018-11-28 11:50:30,655 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 11:50:30,660 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-11-28 11:50:30,660 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-28 11:50:30,661 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 11:50:30,725 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 11:50:30,726 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 11:50:30,727 INFO L168 Benchmark]: Toolchain (without parser) took 12354.09 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 305.1 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -150.9 MB). Peak memory consumption was 154.3 MB. Max. memory is 11.5 GB. [2018-11-28 11:50:30,728 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:50:30,728 INFO L168 Benchmark]: CACSL2BoogieTranslator took 706.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -187.1 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-11-28 11:50:30,734 INFO L168 Benchmark]: Boogie Preprocessor took 75.17 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:50:30,734 INFO L168 Benchmark]: RCFGBuilder took 914.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.9 MB). Peak memory consumption was 45.9 MB. Max. memory is 11.5 GB. [2018-11-28 11:50:30,735 INFO L168 Benchmark]: TraceAbstraction took 10565.16 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 152.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -24.1 MB). Peak memory consumption was 128.0 MB. Max. memory is 11.5 GB. [2018-11-28 11:50:30,735 INFO L168 Benchmark]: Witness Printer took 83.23 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 11.5 GB. [2018-11-28 11:50:30,739 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 706.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -187.1 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 75.17 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 914.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.9 MB). Peak memory consumption was 45.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10565.16 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 152.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -24.1 MB). Peak memory consumption was 128.0 MB. Max. memory is 11.5 GB. * Witness Printer took 83.23 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 638]: 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: 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: 637]: 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: 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: 656]: free always succeeds For all program executions holds that free 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 - PositiveResult [Line: 646]: 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: 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 - 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, 10.5s OverallTime, 9 OverallIterations, 3 TraceHistogramMax, 5.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 300 SDtfs, 590 SDslu, 882 SDs, 0 SdLazy, 1418 SolverSat, 200 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 170 GetRequests, 60 SyntacticMatches, 4 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 5.2s 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.0s 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...