./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/list-ext3-properties/sll_shallow_copy_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/list-ext3-properties/sll_shallow_copy_true-valid-memsafety.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 86b203c3a804c103d90401bd32cfcff28939b920 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 19:49:29,403 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 19:49:29,406 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 19:49:29,421 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 19:49:29,421 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 19:49:29,422 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 19:49:29,424 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 19:49:29,426 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 19:49:29,428 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 19:49:29,429 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 19:49:29,430 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 19:49:29,430 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 19:49:29,431 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 19:49:29,432 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 19:49:29,434 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 19:49:29,434 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 19:49:29,435 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 19:49:29,438 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 19:49:29,440 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 19:49:29,442 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 19:49:29,444 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 19:49:29,445 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 19:49:29,448 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 19:49:29,449 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 19:49:29,449 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 19:49:29,450 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 19:49:29,452 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 19:49:29,453 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 19:49:29,454 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 19:49:29,455 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 19:49:29,456 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 19:49:29,456 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 19:49:29,457 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 19:49:29,457 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 19:49:29,458 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 19:49:29,459 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 19:49:29,460 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-01 19:49:29,481 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 19:49:29,482 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 19:49:29,483 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 19:49:29,483 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 19:49:29,484 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 19:49:29,484 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 19:49:29,484 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 19:49:29,485 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 19:49:29,485 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 19:49:29,485 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 19:49:29,485 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 19:49:29,485 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-01 19:49:29,487 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-01 19:49:29,487 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-01 19:49:29,487 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 19:49:29,487 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 19:49:29,487 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 19:49:29,488 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 19:49:29,488 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 19:49:29,488 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 19:49:29,488 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 19:49:29,488 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 19:49:29,490 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 19:49:29,490 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 19:49:29,490 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 19:49:29,490 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 19:49:29,490 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 86b203c3a804c103d90401bd32cfcff28939b920 [2019-01-01 19:49:29,550 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 19:49:29,565 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 19:49:29,571 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 19:49:29,573 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 19:49:29,573 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 19:49:29,574 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/list-ext3-properties/sll_shallow_copy_true-valid-memsafety.i [2019-01-01 19:49:29,631 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84b86064b/a483c81aecc94be2aad067bacebf7deb/FLAG09d1065b8 [2019-01-01 19:49:30,126 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 19:49:30,127 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-ext3-properties/sll_shallow_copy_true-valid-memsafety.i [2019-01-01 19:49:30,148 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84b86064b/a483c81aecc94be2aad067bacebf7deb/FLAG09d1065b8 [2019-01-01 19:49:30,429 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84b86064b/a483c81aecc94be2aad067bacebf7deb [2019-01-01 19:49:30,433 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 19:49:30,435 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-01 19:49:30,436 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 19:49:30,436 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 19:49:30,440 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 19:49:30,441 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 07:49:30" (1/1) ... [2019-01-01 19:49:30,445 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51539641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:49:30, skipping insertion in model container [2019-01-01 19:49:30,445 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 07:49:30" (1/1) ... [2019-01-01 19:49:30,453 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 19:49:30,495 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 19:49:30,878 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 19:49:30,888 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 19:49:30,929 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 19:49:31,103 INFO L195 MainTranslator]: Completed translation [2019-01-01 19:49:31,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:49:31 WrapperNode [2019-01-01 19:49:31,104 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 19:49:31,104 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 19:49:31,105 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 19:49:31,105 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 19:49:31,122 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:49:31" (1/1) ... [2019-01-01 19:49:31,122 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:49:31" (1/1) ... [2019-01-01 19:49:31,147 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:49:31" (1/1) ... [2019-01-01 19:49:31,147 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:49:31" (1/1) ... [2019-01-01 19:49:31,174 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:49:31" (1/1) ... [2019-01-01 19:49:31,177 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:49:31" (1/1) ... [2019-01-01 19:49:31,184 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:49:31" (1/1) ... [2019-01-01 19:49:31,196 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 19:49:31,196 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 19:49:31,196 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 19:49:31,197 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 19:49:31,197 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:49:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 19:49:31,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-01 19:49:31,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 19:49:31,272 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-01 19:49:31,273 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-01 19:49:31,273 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-01-01 19:49:31,273 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_node [2019-01-01 19:49:31,273 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-01 19:49:31,273 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-01 19:49:31,276 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-01 19:49:31,276 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-01 19:49:31,277 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-01 19:49:31,277 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-01 19:49:31,277 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-01 19:49:31,277 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-01 19:49:31,277 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-01 19:49:31,277 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-01 19:49:31,279 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-01 19:49:31,279 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-01 19:49:31,279 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-01 19:49:31,279 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-01 19:49:31,279 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-01 19:49:31,279 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-01 19:49:31,280 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-01 19:49:31,282 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-01 19:49:31,282 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-01 19:49:31,282 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-01 19:49:31,282 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-01 19:49:31,282 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-01 19:49:31,285 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-01 19:49:31,286 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-01 19:49:31,286 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-01 19:49:31,286 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-01 19:49:31,286 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-01 19:49:31,286 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-01 19:49:31,286 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-01 19:49:31,287 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-01 19:49:31,287 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-01 19:49:31,287 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-01 19:49:31,287 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-01 19:49:31,287 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-01 19:49:31,287 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-01 19:49:31,287 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-01 19:49:31,288 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-01 19:49:31,289 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-01 19:49:31,290 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-01 19:49:31,290 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-01 19:49:31,290 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-01 19:49:31,290 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-01 19:49:31,290 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-01 19:49:31,290 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-01 19:49:31,290 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-01 19:49:31,291 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-01 19:49:31,292 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-01 19:49:31,292 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-01 19:49:31,292 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-01 19:49:31,292 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-01 19:49:31,292 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-01 19:49:31,292 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-01 19:49:31,293 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-01 19:49:31,293 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-01 19:49:31,294 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-01 19:49:31,294 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-01 19:49:31,294 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-01 19:49:31,295 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-01 19:49:31,295 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-01 19:49:31,295 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-01 19:49:31,295 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-01 19:49:31,295 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-01-01 19:49:31,295 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-01 19:49:31,295 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-01 19:49:31,298 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-01-01 19:49:31,298 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-01 19:49:31,298 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-01 19:49:31,299 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-01-01 19:49:31,299 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-01 19:49:31,300 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-01 19:49:31,301 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-01 19:49:31,301 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-01 19:49:31,301 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-01 19:49:31,301 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-01 19:49:31,302 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-01 19:49:31,302 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-01 19:49:31,302 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-01 19:49:31,302 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-01 19:49:31,303 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-01 19:49:31,303 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-01 19:49:31,303 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-01 19:49:31,303 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-01 19:49:31,303 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-01 19:49:31,303 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-01 19:49:31,303 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-01 19:49:31,303 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-01 19:49:31,304 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-01 19:49:31,304 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-01 19:49:31,304 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-01 19:49:31,304 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-01 19:49:31,304 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-01 19:49:31,305 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-01 19:49:31,305 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-01 19:49:31,305 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-01 19:49:31,305 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-01 19:49:31,305 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-01 19:49:31,305 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-01 19:49:31,305 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-01 19:49:31,305 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-01 19:49:31,306 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-01 19:49:31,306 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-01 19:49:31,306 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-01 19:49:31,306 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-01 19:49:31,306 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-01 19:49:31,306 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-01 19:49:31,306 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-01 19:49:31,306 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-01-01 19:49:31,309 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_node [2019-01-01 19:49:31,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-01 19:49:31,309 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-01 19:49:31,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-01 19:49:31,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-01 19:49:31,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 19:49:31,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-01 19:49:31,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 19:49:32,145 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 19:49:32,146 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2019-01-01 19:49:32,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 07:49:32 BoogieIcfgContainer [2019-01-01 19:49:32,147 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 19:49:32,147 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 19:49:32,148 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 19:49:32,151 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 19:49:32,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 07:49:30" (1/3) ... [2019-01-01 19:49:32,152 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f6c07cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 07:49:32, skipping insertion in model container [2019-01-01 19:49:32,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:49:31" (2/3) ... [2019-01-01 19:49:32,152 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f6c07cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 07:49:32, skipping insertion in model container [2019-01-01 19:49:32,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 07:49:32" (3/3) ... [2019-01-01 19:49:32,154 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_shallow_copy_true-valid-memsafety.i [2019-01-01 19:49:32,165 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 19:49:32,174 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2019-01-01 19:49:32,192 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2019-01-01 19:49:32,220 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 19:49:32,220 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 19:49:32,221 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-01 19:49:32,221 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 19:49:32,221 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 19:49:32,221 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 19:49:32,221 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 19:49:32,222 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 19:49:32,222 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 19:49:32,240 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2019-01-01 19:49:32,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-01 19:49:32,251 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:49:32,252 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:49:32,255 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-01-01 19:49:32,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:49:32,263 INFO L82 PathProgramCache]: Analyzing trace with hash 975324898, now seen corresponding path program 1 times [2019-01-01 19:49:32,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:49:32,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:49:32,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:49:32,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:49:32,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:49:32,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:49:32,721 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:49:32,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:49:32,725 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 19:49:32,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:49:32,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:49:32,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:49:32,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-01 19:49:32,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:49:32,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:49:32,881 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-01 19:49:32,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:49:32,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:49:32,975 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 [2019-01-01 19:49:32,977 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:49:32,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:49:32,999 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2019-01-01 19:49:33,062 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:49:33,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:49:33,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 9 [2019-01-01 19:49:33,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-01 19:49:33,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 19:49:33,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-01-01 19:49:33,122 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 10 states. [2019-01-01 19:49:34,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:49:34,953 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2019-01-01 19:49:34,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 19:49:34,958 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-01-01 19:49:34,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:49:34,968 INFO L225 Difference]: With dead ends: 43 [2019-01-01 19:49:34,968 INFO L226 Difference]: Without dead ends: 37 [2019-01-01 19:49:34,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-01-01 19:49:34,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-01 19:49:35,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-01-01 19:49:35,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-01 19:49:35,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-01-01 19:49:35,014 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 19 [2019-01-01 19:49:35,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:49:35,016 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-01-01 19:49:35,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-01 19:49:35,016 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-01-01 19:49:35,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-01 19:49:35,018 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:49:35,018 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:49:35,018 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-01-01 19:49:35,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:49:35,019 INFO L82 PathProgramCache]: Analyzing trace with hash 975324899, now seen corresponding path program 1 times [2019-01-01 19:49:35,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:49:35,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:49:35,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:49:35,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:49:35,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:49:35,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:49:35,387 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-01 19:49:35,443 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:49:35,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:49:35,445 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 19:49:35,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:49:35,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:49:35,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:49:35,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-01 19:49:35,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:49:35,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-01 19:49:35,528 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:49:35,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:49:35,561 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-01-01 19:49:35,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:49:35,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:49:35,708 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 [2019-01-01 19:49:35,709 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:49:35,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-01 19:49:35,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:49:35,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:49:35,756 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2019-01-01 19:49:35,815 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:49:35,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:49:35,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2019-01-01 19:49:35,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-01 19:49:35,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 19:49:35,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-01-01 19:49:35,843 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 11 states. [2019-01-01 19:49:36,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:49:36,326 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-01-01 19:49:36,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 19:49:36,328 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-01-01 19:49:36,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:49:36,330 INFO L225 Difference]: With dead ends: 32 [2019-01-01 19:49:36,330 INFO L226 Difference]: Without dead ends: 32 [2019-01-01 19:49:36,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2019-01-01 19:49:36,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-01 19:49:36,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-01-01 19:49:36,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-01 19:49:36,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-01-01 19:49:36,339 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 19 [2019-01-01 19:49:36,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:49:36,339 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-01-01 19:49:36,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-01 19:49:36,339 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-01-01 19:49:36,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-01 19:49:36,340 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:49:36,340 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:49:36,341 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-01-01 19:49:36,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:49:36,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1236254071, now seen corresponding path program 1 times [2019-01-01 19:49:36,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:49:36,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:49:36,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:49:36,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:49:36,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:49:36,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:49:36,458 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 19:49:36,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:49:36,459 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 19:49:36,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:49:36,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:49:36,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:49:36,519 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 19:49:36,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:49:36,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-01-01 19:49:36,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 19:49:36,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 19:49:36,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 19:49:36,543 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 6 states. [2019-01-01 19:49:36,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:49:36,631 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-01-01 19:49:36,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 19:49:36,632 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-01-01 19:49:36,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:49:36,634 INFO L225 Difference]: With dead ends: 31 [2019-01-01 19:49:36,634 INFO L226 Difference]: Without dead ends: 31 [2019-01-01 19:49:36,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-01 19:49:36,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-01 19:49:36,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-01-01 19:49:36,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-01 19:49:36,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-01-01 19:49:36,640 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 27 [2019-01-01 19:49:36,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:49:36,641 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-01-01 19:49:36,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 19:49:36,641 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-01-01 19:49:36,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-01 19:49:36,642 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:49:36,642 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:49:36,643 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-01-01 19:49:36,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:49:36,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1665781067, now seen corresponding path program 1 times [2019-01-01 19:49:36,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:49:36,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:49:36,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:49:36,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:49:36,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:49:36,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:49:36,808 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 19:49:36,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:49:36,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-01 19:49:36,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-01 19:49:36,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 19:49:36,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-01-01 19:49:36,809 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 9 states. [2019-01-01 19:49:36,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:49:36,930 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-01-01 19:49:36,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 19:49:36,933 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2019-01-01 19:49:36,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:49:36,934 INFO L225 Difference]: With dead ends: 30 [2019-01-01 19:49:36,934 INFO L226 Difference]: Without dead ends: 30 [2019-01-01 19:49:36,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-01-01 19:49:36,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-01 19:49:36,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-01-01 19:49:36,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-01 19:49:36,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-01-01 19:49:36,940 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 29 [2019-01-01 19:49:36,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:49:36,940 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-01-01 19:49:36,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-01 19:49:36,940 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-01-01 19:49:36,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-01 19:49:36,941 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:49:36,941 INFO L402 BasicCegarLoop]: trace histogram [2, 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] [2019-01-01 19:49:36,942 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-01-01 19:49:36,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:49:36,942 INFO L82 PathProgramCache]: Analyzing trace with hash 99605601, now seen corresponding path program 1 times [2019-01-01 19:49:36,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:49:36,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:49:36,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:49:36,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:49:36,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:49:36,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:49:37,134 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 19:49:37,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:49:37,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-01 19:49:37,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-01 19:49:37,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 19:49:37,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-01-01 19:49:37,137 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 9 states. [2019-01-01 19:49:37,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:49:37,309 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-01-01 19:49:37,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 19:49:37,310 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2019-01-01 19:49:37,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:49:37,312 INFO L225 Difference]: With dead ends: 29 [2019-01-01 19:49:37,312 INFO L226 Difference]: Without dead ends: 29 [2019-01-01 19:49:37,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-01-01 19:49:37,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-01 19:49:37,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-01 19:49:37,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-01 19:49:37,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-01-01 19:49:37,317 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 30 [2019-01-01 19:49:37,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:49:37,318 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-01-01 19:49:37,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-01 19:49:37,318 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-01-01 19:49:37,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-01 19:49:37,319 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:49:37,319 INFO L402 BasicCegarLoop]: trace histogram [2, 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] [2019-01-01 19:49:37,320 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-01-01 19:49:37,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:49:37,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1207193587, now seen corresponding path program 1 times [2019-01-01 19:49:37,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:49:37,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:49:37,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:49:37,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:49:37,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:49:37,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:49:37,730 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:49:37,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:49:37,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-01-01 19:49:37,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-01 19:49:37,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-01 19:49:37,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2019-01-01 19:49:37,732 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 15 states. [2019-01-01 19:49:38,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:49:38,257 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-01-01 19:49:38,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-01 19:49:38,259 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 31 [2019-01-01 19:49:38,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:49:38,261 INFO L225 Difference]: With dead ends: 28 [2019-01-01 19:49:38,261 INFO L226 Difference]: Without dead ends: 28 [2019-01-01 19:49:38,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2019-01-01 19:49:38,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-01 19:49:38,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-01-01 19:49:38,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-01 19:49:38,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-01-01 19:49:38,267 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 31 [2019-01-01 19:49:38,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:49:38,267 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-01-01 19:49:38,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-01 19:49:38,268 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-01-01 19:49:38,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-01 19:49:38,270 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:49:38,270 INFO L402 BasicCegarLoop]: trace histogram [2, 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] [2019-01-01 19:49:38,270 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-01-01 19:49:38,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:49:38,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1231704548, now seen corresponding path program 1 times [2019-01-01 19:49:38,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:49:38,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:49:38,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:49:38,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:49:38,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:49:38,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:49:39,359 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 13 [2019-01-01 19:49:39,551 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 19:49:39,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:49:39,551 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 19:49:39,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:49:39,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:49:39,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:49:39,682 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:49:39,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:49:39,688 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:23 [2019-01-01 19:49:39,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-01 19:49:39,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 19:49:39,720 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:49:39,723 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:49:39,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:49:39,733 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:35 [2019-01-01 19:49:39,801 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 50 treesize of output 39 [2019-01-01 19:49:39,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2019-01-01 19:49:39,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:49:39,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:49:39,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:49:39,819 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:35 [2019-01-01 19:49:39,842 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 42 treesize of output 34 [2019-01-01 19:49:39,859 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 34 treesize of output 23 [2019-01-01 19:49:39,860 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:49:39,886 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:49:39,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:49:39,895 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:23 [2019-01-01 19:49:39,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:49:39,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 26 treesize of output 37 [2019-01-01 19:49:39,994 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 23 treesize of output 15 [2019-01-01 19:49:39,995 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:49:40,002 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:49:40,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:49:40,014 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2019-01-01 19:49:40,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:49:40,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:49:40,078 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 [2019-01-01 19:49:40,078 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:49:40,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 19:49:40,094 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:25 [2019-01-01 19:49:40,129 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-01 19:49:40,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 19:49:40,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [14] total 21 [2019-01-01 19:49:40,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-01 19:49:40,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-01 19:49:40,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=412, Unknown=0, NotChecked=0, Total=462 [2019-01-01 19:49:40,150 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 22 states. [2019-01-01 19:49:41,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:49:41,032 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-01-01 19:49:41,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-01 19:49:41,033 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 32 [2019-01-01 19:49:41,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:49:41,033 INFO L225 Difference]: With dead ends: 27 [2019-01-01 19:49:41,034 INFO L226 Difference]: Without dead ends: 0 [2019-01-01 19:49:41,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 24 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=87, Invalid=669, Unknown=0, NotChecked=0, Total=756 [2019-01-01 19:49:41,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-01 19:49:41,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-01 19:49:41,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-01 19:49:41,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 19:49:41,036 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2019-01-01 19:49:41,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:49:41,036 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 19:49:41,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-01 19:49:41,036 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-01 19:49:41,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-01 19:49:41,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 07:49:41 BoogieIcfgContainer [2019-01-01 19:49:41,041 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 19:49:41,042 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 19:49:41,042 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 19:49:41,042 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 19:49:41,043 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 07:49:32" (3/4) ... [2019-01-01 19:49:41,046 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-01 19:49:41,052 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-01 19:49:41,053 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2019-01-01 19:49:41,053 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-01-01 19:49:41,053 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-01-01 19:49:41,053 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-01 19:49:41,053 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure alloc_node [2019-01-01 19:49:41,058 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-01-01 19:49:41,059 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-01 19:49:41,059 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-01 19:49:41,108 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 19:49:41,108 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 19:49:41,109 INFO L168 Benchmark]: Toolchain (without parser) took 10675.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 212.9 MB). Free memory was 951.4 MB in the beginning and 963.7 MB in the end (delta: -12.3 MB). Peak memory consumption was 200.5 MB. Max. memory is 11.5 GB. [2019-01-01 19:49:41,110 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 19:49:41,111 INFO L168 Benchmark]: CACSL2BoogieTranslator took 668.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -173.7 MB). Peak memory consumption was 37.3 MB. Max. memory is 11.5 GB. [2019-01-01 19:49:41,111 INFO L168 Benchmark]: Boogie Preprocessor took 91.41 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: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2019-01-01 19:49:41,115 INFO L168 Benchmark]: RCFGBuilder took 950.56 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: 40.2 MB). Peak memory consumption was 40.2 MB. Max. memory is 11.5 GB. [2019-01-01 19:49:41,116 INFO L168 Benchmark]: TraceAbstraction took 8894.02 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 79.7 MB). Free memory was 1.1 GB in the beginning and 963.7 MB in the end (delta: 107.4 MB). Peak memory consumption was 187.1 MB. Max. memory is 11.5 GB. [2019-01-01 19:49:41,116 INFO L168 Benchmark]: Witness Printer took 66.52 ms. Allocated memory is still 1.2 GB. Free memory is still 963.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 19:49:41,126 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.14 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 668.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -173.7 MB). Peak memory consumption was 37.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 91.41 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: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 950.56 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: 40.2 MB). Peak memory consumption was 40.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8894.02 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 79.7 MB). Free memory was 1.1 GB in the beginning and 963.7 MB in the end (delta: 107.4 MB). Peak memory consumption was 187.1 MB. Max. memory is 11.5 GB. * Witness Printer took 66.52 ms. Allocated memory is still 1.2 GB. Free memory is still 963.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 573]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 573]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 571]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 573]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 570]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 570]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 574]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 571]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 571]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 574]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 571]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 574]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 572]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 572]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 56 locations, 15 error locations. SAFE Result, 8.8s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 4.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 117 SDtfs, 139 SDslu, 555 SDs, 0 SdLazy, 1055 SolverSat, 53 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 199 GetRequests, 85 SyntacticMatches, 13 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=0, 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, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 284 NumberOfCodeBlocks, 284 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 273 ConstructedInterpolants, 14 QuantifiedInterpolants, 58659 SizeOfPredicates, 20 NumberOfNonLiveVariables, 434 ConjunctsInSsa, 85 ConjunctsInUnsatCore, 11 InterpolantComputations, 4 PerfectInterpolantSequences, 27/55 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...