./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/memory-alloca/c.03-alloca_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/memory-alloca/c.03-alloca_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 fbf9a4dabe36f21a3bd9a13ccbb8820aa048cd2e ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 18:10:32,327 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 18:10:32,329 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 18:10:32,346 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 18:10:32,347 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 18:10:32,349 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 18:10:32,351 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 18:10:32,353 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 18:10:32,356 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 18:10:32,358 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 18:10:32,361 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 18:10:32,361 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 18:10:32,362 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 18:10:32,365 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 18:10:32,367 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 18:10:32,368 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 18:10:32,369 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 18:10:32,371 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 18:10:32,373 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 18:10:32,375 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 18:10:32,376 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 18:10:32,377 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 18:10:32,379 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 18:10:32,380 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 18:10:32,380 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 18:10:32,381 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 18:10:32,382 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 18:10:32,383 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 18:10:32,384 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 18:10:32,386 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 18:10:32,389 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 18:10:32,390 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 18:10:32,391 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 18:10:32,391 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 18:10:32,392 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 18:10:32,392 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 18:10:32,396 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-01 18:10:32,418 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 18:10:32,419 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 18:10:32,420 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 18:10:32,420 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 18:10:32,420 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 18:10:32,421 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 18:10:32,421 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 18:10:32,422 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 18:10:32,422 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 18:10:32,422 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 18:10:32,422 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 18:10:32,422 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-01 18:10:32,422 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-01 18:10:32,422 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-01 18:10:32,423 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 18:10:32,423 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 18:10:32,423 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 18:10:32,423 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 18:10:32,423 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 18:10:32,424 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 18:10:32,425 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 18:10:32,425 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 18:10:32,426 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 18:10:32,426 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 18:10:32,426 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 18:10:32,427 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 18:10:32,427 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 -> fbf9a4dabe36f21a3bd9a13ccbb8820aa048cd2e [2019-01-01 18:10:32,489 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 18:10:32,505 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 18:10:32,510 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 18:10:32,512 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 18:10:32,512 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 18:10:32,513 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/memory-alloca/c.03-alloca_true-valid-memsafety.i [2019-01-01 18:10:32,579 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57444b065/70f3f815709b4340bbea0db81ffd664e/FLAGc9a79447a [2019-01-01 18:10:33,163 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 18:10:33,164 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/memory-alloca/c.03-alloca_true-valid-memsafety.i [2019-01-01 18:10:33,195 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57444b065/70f3f815709b4340bbea0db81ffd664e/FLAGc9a79447a [2019-01-01 18:10:33,543 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57444b065/70f3f815709b4340bbea0db81ffd664e [2019-01-01 18:10:33,547 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 18:10:33,549 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-01 18:10:33,550 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 18:10:33,550 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 18:10:33,554 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 18:10:33,555 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 06:10:33" (1/1) ... [2019-01-01 18:10:33,559 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e501ed7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 06:10:33, skipping insertion in model container [2019-01-01 18:10:33,560 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 06:10:33" (1/1) ... [2019-01-01 18:10:33,571 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 18:10:33,631 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 18:10:34,023 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 18:10:34,042 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 18:10:34,178 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 18:10:34,237 INFO L195 MainTranslator]: Completed translation [2019-01-01 18:10:34,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 06:10:34 WrapperNode [2019-01-01 18:10:34,238 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 18:10:34,239 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 18:10:34,240 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 18:10:34,240 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 18:10:34,255 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 06:10:34" (1/1) ... [2019-01-01 18:10:34,256 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 06:10:34" (1/1) ... [2019-01-01 18:10:34,279 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 06:10:34" (1/1) ... [2019-01-01 18:10:34,282 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 06:10:34" (1/1) ... [2019-01-01 18:10:34,299 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 06:10:34" (1/1) ... [2019-01-01 18:10:34,304 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 06:10:34" (1/1) ... [2019-01-01 18:10:34,308 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 06:10:34" (1/1) ... [2019-01-01 18:10:34,320 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 18:10:34,321 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 18:10:34,321 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 18:10:34,321 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 18:10:34,322 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 06:10:34" (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 18:10:34,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-01 18:10:34,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 18:10:34,388 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-01 18:10:34,388 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-01 18:10:34,389 INFO L138 BoogieDeclarations]: Found implementation of procedure test_fun [2019-01-01 18:10:34,389 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-01 18:10:34,389 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-01 18:10:34,389 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-01 18:10:34,389 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-01 18:10:34,389 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-01 18:10:34,390 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-01 18:10:34,390 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-01 18:10:34,390 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-01 18:10:34,390 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-01 18:10:34,390 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-01 18:10:34,390 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-01 18:10:34,391 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-01 18:10:34,391 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-01 18:10:34,391 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-01 18:10:34,391 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-01 18:10:34,393 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-01 18:10:34,393 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-01 18:10:34,393 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-01 18:10:34,393 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-01 18:10:34,393 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-01 18:10:34,393 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-01 18:10:34,394 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-01 18:10:34,394 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-01 18:10:34,394 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-01 18:10:34,394 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-01 18:10:34,394 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-01 18:10:34,394 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-01 18:10:34,395 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-01 18:10:34,396 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-01 18:10:34,396 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-01 18:10:34,396 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-01 18:10:34,397 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-01 18:10:34,397 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-01 18:10:34,397 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-01 18:10:34,397 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-01 18:10:34,398 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-01 18:10:34,398 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-01 18:10:34,398 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-01 18:10:34,399 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-01 18:10:34,399 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-01 18:10:34,399 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-01 18:10:34,399 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-01 18:10:34,399 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-01 18:10:34,399 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-01 18:10:34,399 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-01 18:10:34,401 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-01 18:10:34,401 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-01 18:10:34,401 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-01 18:10:34,401 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-01 18:10:34,401 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-01 18:10:34,402 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-01 18:10:34,402 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-01 18:10:34,402 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-01 18:10:34,403 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-01 18:10:34,403 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-01 18:10:34,403 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-01 18:10:34,403 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-01 18:10:34,403 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-01 18:10:34,403 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-01 18:10:34,404 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-01 18:10:34,404 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-01 18:10:34,404 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-01 18:10:34,404 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-01 18:10:34,404 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-01 18:10:34,404 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-01 18:10:34,404 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-01 18:10:34,405 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-01 18:10:34,405 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-01 18:10:34,405 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-01 18:10:34,405 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-01 18:10:34,405 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-01 18:10:34,405 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-01 18:10:34,406 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-01 18:10:34,408 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-01 18:10:34,408 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-01 18:10:34,408 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-01 18:10:34,408 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-01 18:10:34,409 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-01 18:10:34,409 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-01 18:10:34,409 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-01 18:10:34,409 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-01 18:10:34,409 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-01 18:10:34,409 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-01 18:10:34,409 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-01 18:10:34,410 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-01 18:10:34,410 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-01 18:10:34,410 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-01 18:10:34,410 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-01 18:10:34,410 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-01 18:10:34,410 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-01 18:10:34,412 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-01 18:10:34,412 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-01 18:10:34,413 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-01 18:10:34,413 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-01 18:10:34,413 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-01 18:10:34,413 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-01 18:10:34,413 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-01 18:10:34,413 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-01 18:10:34,413 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-01 18:10:34,413 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-01 18:10:34,415 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-01 18:10:34,415 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-01 18:10:34,415 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-01 18:10:34,415 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-01 18:10:34,415 INFO L130 BoogieDeclarations]: Found specification of procedure test_fun [2019-01-01 18:10:34,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 18:10:34,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 18:10:34,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 18:10:34,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 18:10:34,417 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-01 18:10:34,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-01 18:10:34,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 18:10:35,241 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 18:10:35,242 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2019-01-01 18:10:35,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 06:10:35 BoogieIcfgContainer [2019-01-01 18:10:35,242 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 18:10:35,243 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 18:10:35,243 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 18:10:35,246 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 18:10:35,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 06:10:33" (1/3) ... [2019-01-01 18:10:35,247 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ee0e38c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 06:10:35, skipping insertion in model container [2019-01-01 18:10:35,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 06:10:34" (2/3) ... [2019-01-01 18:10:35,248 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ee0e38c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 06:10:35, skipping insertion in model container [2019-01-01 18:10:35,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 06:10:35" (3/3) ... [2019-01-01 18:10:35,250 INFO L112 eAbstractionObserver]: Analyzing ICFG c.03-alloca_true-valid-memsafety.i [2019-01-01 18:10:35,260 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 18:10:35,269 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 31 error locations. [2019-01-01 18:10:35,285 INFO L257 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2019-01-01 18:10:35,314 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 18:10:35,315 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 18:10:35,315 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-01 18:10:35,315 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 18:10:35,315 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 18:10:35,316 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 18:10:35,316 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 18:10:35,316 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 18:10:35,316 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 18:10:35,336 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states. [2019-01-01 18:10:35,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-01 18:10:35,347 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:10:35,348 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:10:35,351 INFO L423 AbstractCegarLoop]: === Iteration 1 === [test_funErr20REQUIRES_VIOLATION, test_funErr19REQUIRES_VIOLATION, test_funErr18REQUIRES_VIOLATION, test_funErr17REQUIRES_VIOLATION, test_funErr16REQUIRES_VIOLATION, test_funErr26REQUIRES_VIOLATION, test_funErr4REQUIRES_VIOLATION, test_funErr25REQUIRES_VIOLATION, test_funErr3REQUIRES_VIOLATION, test_funErr24REQUIRES_VIOLATION, test_funErr2REQUIRES_VIOLATION, test_funErr23REQUIRES_VIOLATION, test_funErr1REQUIRES_VIOLATION, test_funErr22REQUIRES_VIOLATION, test_funErr21REQUIRES_VIOLATION, test_funErr0REQUIRES_VIOLATION, test_funErr10REQUIRES_VIOLATION, test_funErr9REQUIRES_VIOLATION, test_funErr8REQUIRES_VIOLATION, test_funErr29REQUIRES_VIOLATION, test_funErr7REQUIRES_VIOLATION, test_funErr28REQUIRES_VIOLATION, test_funErr6REQUIRES_VIOLATION, test_funErr27REQUIRES_VIOLATION, test_funErr5REQUIRES_VIOLATION, test_funErr15REQUIRES_VIOLATION, test_funErr14REQUIRES_VIOLATION, test_funErr13REQUIRES_VIOLATION, test_funErr12REQUIRES_VIOLATION, test_funErr11REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-01 18:10:35,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:10:35,358 INFO L82 PathProgramCache]: Analyzing trace with hash 889529511, now seen corresponding path program 1 times [2019-01-01 18:10:35,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:10:35,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:10:35,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:10:35,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:10:35,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:10:35,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:10:35,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 18:10:35,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:10:35,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 18:10:35,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 18:10:35,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 18:10:35,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 18:10:35,643 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 3 states. [2019-01-01 18:10:35,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:10:35,910 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2019-01-01 18:10:35,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 18:10:35,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-01-01 18:10:35,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:10:35,925 INFO L225 Difference]: With dead ends: 62 [2019-01-01 18:10:35,926 INFO L226 Difference]: Without dead ends: 59 [2019-01-01 18:10:35,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 18:10:35,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-01 18:10:35,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-01-01 18:10:35,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-01 18:10:35,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-01-01 18:10:35,976 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 9 [2019-01-01 18:10:35,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:10:35,977 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-01-01 18:10:35,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 18:10:35,977 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-01-01 18:10:35,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-01 18:10:35,978 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:10:35,978 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:10:35,978 INFO L423 AbstractCegarLoop]: === Iteration 2 === [test_funErr20REQUIRES_VIOLATION, test_funErr19REQUIRES_VIOLATION, test_funErr18REQUIRES_VIOLATION, test_funErr17REQUIRES_VIOLATION, test_funErr16REQUIRES_VIOLATION, test_funErr26REQUIRES_VIOLATION, test_funErr4REQUIRES_VIOLATION, test_funErr25REQUIRES_VIOLATION, test_funErr3REQUIRES_VIOLATION, test_funErr24REQUIRES_VIOLATION, test_funErr2REQUIRES_VIOLATION, test_funErr23REQUIRES_VIOLATION, test_funErr1REQUIRES_VIOLATION, test_funErr22REQUIRES_VIOLATION, test_funErr21REQUIRES_VIOLATION, test_funErr0REQUIRES_VIOLATION, test_funErr10REQUIRES_VIOLATION, test_funErr9REQUIRES_VIOLATION, test_funErr8REQUIRES_VIOLATION, test_funErr29REQUIRES_VIOLATION, test_funErr7REQUIRES_VIOLATION, test_funErr28REQUIRES_VIOLATION, test_funErr6REQUIRES_VIOLATION, test_funErr27REQUIRES_VIOLATION, test_funErr5REQUIRES_VIOLATION, test_funErr15REQUIRES_VIOLATION, test_funErr14REQUIRES_VIOLATION, test_funErr13REQUIRES_VIOLATION, test_funErr12REQUIRES_VIOLATION, test_funErr11REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-01 18:10:35,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:10:35,979 INFO L82 PathProgramCache]: Analyzing trace with hash 889529512, now seen corresponding path program 1 times [2019-01-01 18:10:35,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:10:35,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:10:35,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:10:35,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:10:35,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:10:36,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:10:36,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 18:10:36,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:10:36,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 18:10:36,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 18:10:36,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 18:10:36,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 18:10:36,078 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 3 states. [2019-01-01 18:10:36,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:10:36,311 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2019-01-01 18:10:36,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 18:10:36,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-01-01 18:10:36,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:10:36,314 INFO L225 Difference]: With dead ends: 54 [2019-01-01 18:10:36,314 INFO L226 Difference]: Without dead ends: 54 [2019-01-01 18:10:36,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 18:10:36,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-01 18:10:36,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-01-01 18:10:36,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-01 18:10:36,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2019-01-01 18:10:36,324 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 9 [2019-01-01 18:10:36,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:10:36,325 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2019-01-01 18:10:36,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 18:10:36,325 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2019-01-01 18:10:36,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-01 18:10:36,326 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:10:36,326 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:10:36,326 INFO L423 AbstractCegarLoop]: === Iteration 3 === [test_funErr20REQUIRES_VIOLATION, test_funErr19REQUIRES_VIOLATION, test_funErr18REQUIRES_VIOLATION, test_funErr17REQUIRES_VIOLATION, test_funErr16REQUIRES_VIOLATION, test_funErr26REQUIRES_VIOLATION, test_funErr4REQUIRES_VIOLATION, test_funErr25REQUIRES_VIOLATION, test_funErr3REQUIRES_VIOLATION, test_funErr24REQUIRES_VIOLATION, test_funErr2REQUIRES_VIOLATION, test_funErr23REQUIRES_VIOLATION, test_funErr1REQUIRES_VIOLATION, test_funErr22REQUIRES_VIOLATION, test_funErr21REQUIRES_VIOLATION, test_funErr0REQUIRES_VIOLATION, test_funErr10REQUIRES_VIOLATION, test_funErr9REQUIRES_VIOLATION, test_funErr8REQUIRES_VIOLATION, test_funErr29REQUIRES_VIOLATION, test_funErr7REQUIRES_VIOLATION, test_funErr28REQUIRES_VIOLATION, test_funErr6REQUIRES_VIOLATION, test_funErr27REQUIRES_VIOLATION, test_funErr5REQUIRES_VIOLATION, test_funErr15REQUIRES_VIOLATION, test_funErr14REQUIRES_VIOLATION, test_funErr13REQUIRES_VIOLATION, test_funErr12REQUIRES_VIOLATION, test_funErr11REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-01 18:10:36,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:10:36,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1805611050, now seen corresponding path program 1 times [2019-01-01 18:10:36,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:10:36,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:10:36,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:10:36,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:10:36,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:10:36,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:10:36,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 18:10:36,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:10:36,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 18:10:36,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 18:10:36,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 18:10:36,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 18:10:36,423 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 3 states. [2019-01-01 18:10:36,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:10:36,551 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2019-01-01 18:10:36,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 18:10:36,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-01 18:10:36,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:10:36,554 INFO L225 Difference]: With dead ends: 52 [2019-01-01 18:10:36,554 INFO L226 Difference]: Without dead ends: 52 [2019-01-01 18:10:36,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 18:10:36,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-01 18:10:36,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-01-01 18:10:36,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-01 18:10:36,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2019-01-01 18:10:36,563 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 10 [2019-01-01 18:10:36,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:10:36,564 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2019-01-01 18:10:36,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 18:10:36,564 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2019-01-01 18:10:36,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-01 18:10:36,565 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:10:36,565 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:10:36,565 INFO L423 AbstractCegarLoop]: === Iteration 4 === [test_funErr20REQUIRES_VIOLATION, test_funErr19REQUIRES_VIOLATION, test_funErr18REQUIRES_VIOLATION, test_funErr17REQUIRES_VIOLATION, test_funErr16REQUIRES_VIOLATION, test_funErr26REQUIRES_VIOLATION, test_funErr4REQUIRES_VIOLATION, test_funErr25REQUIRES_VIOLATION, test_funErr3REQUIRES_VIOLATION, test_funErr24REQUIRES_VIOLATION, test_funErr2REQUIRES_VIOLATION, test_funErr23REQUIRES_VIOLATION, test_funErr1REQUIRES_VIOLATION, test_funErr22REQUIRES_VIOLATION, test_funErr21REQUIRES_VIOLATION, test_funErr0REQUIRES_VIOLATION, test_funErr10REQUIRES_VIOLATION, test_funErr9REQUIRES_VIOLATION, test_funErr8REQUIRES_VIOLATION, test_funErr29REQUIRES_VIOLATION, test_funErr7REQUIRES_VIOLATION, test_funErr28REQUIRES_VIOLATION, test_funErr6REQUIRES_VIOLATION, test_funErr27REQUIRES_VIOLATION, test_funErr5REQUIRES_VIOLATION, test_funErr15REQUIRES_VIOLATION, test_funErr14REQUIRES_VIOLATION, test_funErr13REQUIRES_VIOLATION, test_funErr12REQUIRES_VIOLATION, test_funErr11REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-01 18:10:36,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:10:36,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1805611051, now seen corresponding path program 1 times [2019-01-01 18:10:36,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:10:36,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:10:36,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:10:36,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:10:36,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:10:36,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:10:36,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 18:10:36,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:10:36,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 18:10:36,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 18:10:36,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 18:10:36,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 18:10:36,726 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 3 states. [2019-01-01 18:10:36,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:10:36,982 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2019-01-01 18:10:36,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 18:10:36,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-01 18:10:36,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:10:36,985 INFO L225 Difference]: With dead ends: 50 [2019-01-01 18:10:36,985 INFO L226 Difference]: Without dead ends: 50 [2019-01-01 18:10:36,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 18:10:36,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-01 18:10:36,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-01-01 18:10:36,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-01 18:10:36,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2019-01-01 18:10:36,993 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 10 [2019-01-01 18:10:36,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:10:36,993 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2019-01-01 18:10:36,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 18:10:36,993 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2019-01-01 18:10:36,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-01 18:10:36,994 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:10:36,994 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:10:36,994 INFO L423 AbstractCegarLoop]: === Iteration 5 === [test_funErr20REQUIRES_VIOLATION, test_funErr19REQUIRES_VIOLATION, test_funErr18REQUIRES_VIOLATION, test_funErr17REQUIRES_VIOLATION, test_funErr16REQUIRES_VIOLATION, test_funErr26REQUIRES_VIOLATION, test_funErr4REQUIRES_VIOLATION, test_funErr25REQUIRES_VIOLATION, test_funErr3REQUIRES_VIOLATION, test_funErr24REQUIRES_VIOLATION, test_funErr2REQUIRES_VIOLATION, test_funErr23REQUIRES_VIOLATION, test_funErr1REQUIRES_VIOLATION, test_funErr22REQUIRES_VIOLATION, test_funErr21REQUIRES_VIOLATION, test_funErr0REQUIRES_VIOLATION, test_funErr10REQUIRES_VIOLATION, test_funErr9REQUIRES_VIOLATION, test_funErr8REQUIRES_VIOLATION, test_funErr29REQUIRES_VIOLATION, test_funErr7REQUIRES_VIOLATION, test_funErr28REQUIRES_VIOLATION, test_funErr6REQUIRES_VIOLATION, test_funErr27REQUIRES_VIOLATION, test_funErr5REQUIRES_VIOLATION, test_funErr15REQUIRES_VIOLATION, test_funErr14REQUIRES_VIOLATION, test_funErr13REQUIRES_VIOLATION, test_funErr12REQUIRES_VIOLATION, test_funErr11REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-01 18:10:36,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:10:36,995 INFO L82 PathProgramCache]: Analyzing trace with hash 139367690, now seen corresponding path program 1 times [2019-01-01 18:10:36,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:10:36,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:10:36,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:10:36,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:10:36,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:10:37,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:10:37,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 18:10:37,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:10:37,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 18:10:37,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 18:10:37,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 18:10:37,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 18:10:37,091 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 3 states. [2019-01-01 18:10:37,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:10:37,216 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2019-01-01 18:10:37,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 18:10:37,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-01-01 18:10:37,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:10:37,218 INFO L225 Difference]: With dead ends: 46 [2019-01-01 18:10:37,218 INFO L226 Difference]: Without dead ends: 46 [2019-01-01 18:10:37,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 18:10:37,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-01 18:10:37,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-01-01 18:10:37,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-01 18:10:37,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2019-01-01 18:10:37,224 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 11 [2019-01-01 18:10:37,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:10:37,225 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2019-01-01 18:10:37,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 18:10:37,225 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2019-01-01 18:10:37,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-01 18:10:37,226 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:10:37,226 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:10:37,226 INFO L423 AbstractCegarLoop]: === Iteration 6 === [test_funErr20REQUIRES_VIOLATION, test_funErr19REQUIRES_VIOLATION, test_funErr18REQUIRES_VIOLATION, test_funErr17REQUIRES_VIOLATION, test_funErr16REQUIRES_VIOLATION, test_funErr26REQUIRES_VIOLATION, test_funErr4REQUIRES_VIOLATION, test_funErr25REQUIRES_VIOLATION, test_funErr3REQUIRES_VIOLATION, test_funErr24REQUIRES_VIOLATION, test_funErr2REQUIRES_VIOLATION, test_funErr23REQUIRES_VIOLATION, test_funErr1REQUIRES_VIOLATION, test_funErr22REQUIRES_VIOLATION, test_funErr21REQUIRES_VIOLATION, test_funErr0REQUIRES_VIOLATION, test_funErr10REQUIRES_VIOLATION, test_funErr9REQUIRES_VIOLATION, test_funErr8REQUIRES_VIOLATION, test_funErr29REQUIRES_VIOLATION, test_funErr7REQUIRES_VIOLATION, test_funErr28REQUIRES_VIOLATION, test_funErr6REQUIRES_VIOLATION, test_funErr27REQUIRES_VIOLATION, test_funErr5REQUIRES_VIOLATION, test_funErr15REQUIRES_VIOLATION, test_funErr14REQUIRES_VIOLATION, test_funErr13REQUIRES_VIOLATION, test_funErr12REQUIRES_VIOLATION, test_funErr11REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-01 18:10:37,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:10:37,227 INFO L82 PathProgramCache]: Analyzing trace with hash 139367691, now seen corresponding path program 1 times [2019-01-01 18:10:37,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:10:37,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:10:37,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:10:37,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:10:37,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:10:37,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:10:37,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 18:10:37,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:10:37,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 18:10:37,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 18:10:37,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 18:10:37,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 18:10:37,301 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 3 states. [2019-01-01 18:10:37,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:10:37,355 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2019-01-01 18:10:37,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 18:10:37,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-01-01 18:10:37,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:10:37,357 INFO L225 Difference]: With dead ends: 42 [2019-01-01 18:10:37,357 INFO L226 Difference]: Without dead ends: 42 [2019-01-01 18:10:37,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 18:10:37,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-01 18:10:37,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-01-01 18:10:37,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-01 18:10:37,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2019-01-01 18:10:37,364 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 11 [2019-01-01 18:10:37,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:10:37,364 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2019-01-01 18:10:37,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 18:10:37,365 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2019-01-01 18:10:37,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-01 18:10:37,365 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:10:37,365 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:10:37,366 INFO L423 AbstractCegarLoop]: === Iteration 7 === [test_funErr20REQUIRES_VIOLATION, test_funErr19REQUIRES_VIOLATION, test_funErr18REQUIRES_VIOLATION, test_funErr17REQUIRES_VIOLATION, test_funErr16REQUIRES_VIOLATION, test_funErr26REQUIRES_VIOLATION, test_funErr4REQUIRES_VIOLATION, test_funErr25REQUIRES_VIOLATION, test_funErr3REQUIRES_VIOLATION, test_funErr24REQUIRES_VIOLATION, test_funErr2REQUIRES_VIOLATION, test_funErr23REQUIRES_VIOLATION, test_funErr1REQUIRES_VIOLATION, test_funErr22REQUIRES_VIOLATION, test_funErr21REQUIRES_VIOLATION, test_funErr0REQUIRES_VIOLATION, test_funErr10REQUIRES_VIOLATION, test_funErr9REQUIRES_VIOLATION, test_funErr8REQUIRES_VIOLATION, test_funErr29REQUIRES_VIOLATION, test_funErr7REQUIRES_VIOLATION, test_funErr28REQUIRES_VIOLATION, test_funErr6REQUIRES_VIOLATION, test_funErr27REQUIRES_VIOLATION, test_funErr5REQUIRES_VIOLATION, test_funErr15REQUIRES_VIOLATION, test_funErr14REQUIRES_VIOLATION, test_funErr13REQUIRES_VIOLATION, test_funErr12REQUIRES_VIOLATION, test_funErr11REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-01 18:10:37,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:10:37,366 INFO L82 PathProgramCache]: Analyzing trace with hash 25431085, now seen corresponding path program 1 times [2019-01-01 18:10:37,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:10:37,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:10:37,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:10:37,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:10:37,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:10:37,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:10:37,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 18:10:37,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:10:37,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 18:10:37,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 18:10:37,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 18:10:37,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 18:10:37,436 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 3 states. [2019-01-01 18:10:37,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:10:37,612 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2019-01-01 18:10:37,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 18:10:37,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-01-01 18:10:37,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:10:37,614 INFO L225 Difference]: With dead ends: 38 [2019-01-01 18:10:37,615 INFO L226 Difference]: Without dead ends: 38 [2019-01-01 18:10:37,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 18:10:37,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-01 18:10:37,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-01-01 18:10:37,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-01 18:10:37,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-01-01 18:10:37,620 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 12 [2019-01-01 18:10:37,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:10:37,621 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-01-01 18:10:37,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 18:10:37,621 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-01-01 18:10:37,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-01 18:10:37,621 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:10:37,622 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:10:37,623 INFO L423 AbstractCegarLoop]: === Iteration 8 === [test_funErr20REQUIRES_VIOLATION, test_funErr19REQUIRES_VIOLATION, test_funErr18REQUIRES_VIOLATION, test_funErr17REQUIRES_VIOLATION, test_funErr16REQUIRES_VIOLATION, test_funErr26REQUIRES_VIOLATION, test_funErr4REQUIRES_VIOLATION, test_funErr25REQUIRES_VIOLATION, test_funErr3REQUIRES_VIOLATION, test_funErr24REQUIRES_VIOLATION, test_funErr2REQUIRES_VIOLATION, test_funErr23REQUIRES_VIOLATION, test_funErr1REQUIRES_VIOLATION, test_funErr22REQUIRES_VIOLATION, test_funErr21REQUIRES_VIOLATION, test_funErr0REQUIRES_VIOLATION, test_funErr10REQUIRES_VIOLATION, test_funErr9REQUIRES_VIOLATION, test_funErr8REQUIRES_VIOLATION, test_funErr29REQUIRES_VIOLATION, test_funErr7REQUIRES_VIOLATION, test_funErr28REQUIRES_VIOLATION, test_funErr6REQUIRES_VIOLATION, test_funErr27REQUIRES_VIOLATION, test_funErr5REQUIRES_VIOLATION, test_funErr15REQUIRES_VIOLATION, test_funErr14REQUIRES_VIOLATION, test_funErr13REQUIRES_VIOLATION, test_funErr12REQUIRES_VIOLATION, test_funErr11REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-01 18:10:37,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:10:37,623 INFO L82 PathProgramCache]: Analyzing trace with hash 25431086, now seen corresponding path program 1 times [2019-01-01 18:10:37,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:10:37,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:10:37,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:10:37,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:10:37,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:10:37,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:10:37,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 18:10:37,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:10:37,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 18:10:37,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 18:10:37,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 18:10:37,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 18:10:37,699 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 3 states. [2019-01-01 18:10:37,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:10:37,746 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2019-01-01 18:10:37,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 18:10:37,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-01-01 18:10:37,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:10:37,747 INFO L225 Difference]: With dead ends: 34 [2019-01-01 18:10:37,747 INFO L226 Difference]: Without dead ends: 34 [2019-01-01 18:10:37,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 18:10:37,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-01 18:10:37,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-01-01 18:10:37,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-01 18:10:37,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2019-01-01 18:10:37,755 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 12 [2019-01-01 18:10:37,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:10:37,755 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2019-01-01 18:10:37,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 18:10:37,758 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2019-01-01 18:10:37,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-01 18:10:37,759 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:10:37,759 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:10:37,759 INFO L423 AbstractCegarLoop]: === Iteration 9 === [test_funErr20REQUIRES_VIOLATION, test_funErr19REQUIRES_VIOLATION, test_funErr18REQUIRES_VIOLATION, test_funErr17REQUIRES_VIOLATION, test_funErr16REQUIRES_VIOLATION, test_funErr26REQUIRES_VIOLATION, test_funErr4REQUIRES_VIOLATION, test_funErr25REQUIRES_VIOLATION, test_funErr3REQUIRES_VIOLATION, test_funErr24REQUIRES_VIOLATION, test_funErr2REQUIRES_VIOLATION, test_funErr23REQUIRES_VIOLATION, test_funErr1REQUIRES_VIOLATION, test_funErr22REQUIRES_VIOLATION, test_funErr21REQUIRES_VIOLATION, test_funErr0REQUIRES_VIOLATION, test_funErr10REQUIRES_VIOLATION, test_funErr9REQUIRES_VIOLATION, test_funErr8REQUIRES_VIOLATION, test_funErr29REQUIRES_VIOLATION, test_funErr7REQUIRES_VIOLATION, test_funErr28REQUIRES_VIOLATION, test_funErr6REQUIRES_VIOLATION, test_funErr27REQUIRES_VIOLATION, test_funErr5REQUIRES_VIOLATION, test_funErr15REQUIRES_VIOLATION, test_funErr14REQUIRES_VIOLATION, test_funErr13REQUIRES_VIOLATION, test_funErr12REQUIRES_VIOLATION, test_funErr11REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-01 18:10:37,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:10:37,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1586130209, now seen corresponding path program 1 times [2019-01-01 18:10:37,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:10:37,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:10:37,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:10:37,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:10:37,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:10:37,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:10:38,136 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-01-01 18:10:38,262 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-01-01 18:10:38,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 18:10:38,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:10:38,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 18:10:38,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 18:10:38,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 18:10:38,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-01 18:10:38,297 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 5 states. [2019-01-01 18:10:38,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:10:38,432 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-01-01 18:10:38,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 18:10:38,433 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-01-01 18:10:38,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:10:38,433 INFO L225 Difference]: With dead ends: 33 [2019-01-01 18:10:38,433 INFO L226 Difference]: Without dead ends: 0 [2019-01-01 18:10:38,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-01 18:10:38,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-01 18:10:38,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-01 18:10:38,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-01 18:10:38,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 18:10:38,435 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-01-01 18:10:38,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:10:38,435 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 18:10:38,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 18:10:38,435 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-01 18:10:38,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-01 18:10:38,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 06:10:38 BoogieIcfgContainer [2019-01-01 18:10:38,441 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 18:10:38,441 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 18:10:38,441 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 18:10:38,442 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 18:10:38,442 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 06:10:35" (3/4) ... [2019-01-01 18:10:38,446 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-01 18:10:38,454 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-01 18:10:38,454 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-01-01 18:10:38,454 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure test_fun [2019-01-01 18:10:38,455 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-01-01 18:10:38,455 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-01 18:10:38,461 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2019-01-01 18:10:38,462 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-01-01 18:10:38,462 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-01 18:10:38,521 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 18:10:38,522 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 18:10:38,523 INFO L168 Benchmark]: Toolchain (without parser) took 4975.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 952.7 MB in the beginning and 917.6 MB in the end (delta: 35.1 MB). Peak memory consumption was 176.1 MB. Max. memory is 11.5 GB. [2019-01-01 18:10:38,524 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 18:10:38,524 INFO L168 Benchmark]: CACSL2BoogieTranslator took 689.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -170.1 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. [2019-01-01 18:10:38,525 INFO L168 Benchmark]: Boogie Preprocessor took 81.29 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 18:10:38,525 INFO L168 Benchmark]: RCFGBuilder took 921.19 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: 51.6 MB). Peak memory consumption was 51.6 MB. Max. memory is 11.5 GB. [2019-01-01 18:10:38,526 INFO L168 Benchmark]: TraceAbstraction took 3197.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 924.3 MB in the end (delta: 147.0 MB). Peak memory consumption was 147.0 MB. Max. memory is 11.5 GB. [2019-01-01 18:10:38,527 INFO L168 Benchmark]: Witness Printer took 80.25 ms. Allocated memory is still 1.2 GB. Free memory is still 917.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 18:10:38,530 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 689.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -170.1 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 81.29 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 921.19 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: 51.6 MB). Peak memory consumption was 51.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3197.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 924.3 MB in the end (delta: 147.0 MB). Peak memory consumption was 147.0 MB. Max. memory is 11.5 GB. * Witness Printer took 80.25 ms. Allocated memory is still 1.2 GB. Free memory is still 917.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 554]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 556]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 556]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 556]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 554]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 554]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 554]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 558]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 558]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 556]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 560]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 31 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 73 locations, 31 error locations. SAFE Result, 3.1s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 218 SDtfs, 297 SDslu, 93 SDs, 0 SdLazy, 248 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred 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, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 105 NumberOfCodeBlocks, 105 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 21912 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...