./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 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/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-0ed9222-m [2019-01-13 22:53:42,469 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 22:53:42,472 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 22:53:42,489 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 22:53:42,490 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 22:53:42,491 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 22:53:42,494 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 22:53:42,497 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 22:53:42,501 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 22:53:42,503 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 22:53:42,506 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 22:53:42,506 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 22:53:42,507 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 22:53:42,510 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 22:53:42,517 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 22:53:42,520 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 22:53:42,521 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 22:53:42,524 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 22:53:42,526 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 22:53:42,530 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 22:53:42,531 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 22:53:42,534 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 22:53:42,540 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 22:53:42,541 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 22:53:42,541 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 22:53:42,542 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 22:53:42,544 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 22:53:42,547 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 22:53:42,548 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 22:53:42,549 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 22:53:42,549 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 22:53:42,550 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 22:53:42,552 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 22:53:42,552 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 22:53:42,554 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 22:53:42,555 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 22:53:42,557 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-13 22:53:42,585 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 22:53:42,586 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 22:53:42,587 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 22:53:42,587 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 22:53:42,587 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 22:53:42,587 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 22:53:42,590 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 22:53:42,591 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-13 22:53:42,591 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 22:53:42,591 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 22:53:42,592 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 22:53:42,592 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-13 22:53:42,592 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-13 22:53:42,592 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-13 22:53:42,592 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 22:53:42,593 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 22:53:42,593 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 22:53:42,594 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 22:53:42,594 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 22:53:42,594 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 22:53:42,594 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 22:53:42,594 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 22:53:42,594 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 22:53:42,595 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 22:53:42,595 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 22:53:42,595 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 22:53:42,595 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-13 22:53:42,660 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 22:53:42,676 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 22:53:42,682 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 22:53:42,684 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 22:53:42,684 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 22:53:42,685 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/memory-alloca/c.03-alloca_true-valid-memsafety.i [2019-01-13 22:53:42,744 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eed041500/874e905c82a04e85ad34f44ae7a4f9ef/FLAGb206d4a22 [2019-01-13 22:53:43,252 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 22:53:43,253 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/memory-alloca/c.03-alloca_true-valid-memsafety.i [2019-01-13 22:53:43,266 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eed041500/874e905c82a04e85ad34f44ae7a4f9ef/FLAGb206d4a22 [2019-01-13 22:53:43,543 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eed041500/874e905c82a04e85ad34f44ae7a4f9ef [2019-01-13 22:53:43,547 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 22:53:43,549 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-13 22:53:43,550 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 22:53:43,550 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 22:53:43,555 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 22:53:43,556 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 10:53:43" (1/1) ... [2019-01-13 22:53:43,560 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c59de3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:53:43, skipping insertion in model container [2019-01-13 22:53:43,560 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 10:53:43" (1/1) ... [2019-01-13 22:53:43,568 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 22:53:43,618 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 22:53:44,033 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 22:53:44,045 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 22:53:44,176 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 22:53:44,231 INFO L195 MainTranslator]: Completed translation [2019-01-13 22:53:44,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:53:44 WrapperNode [2019-01-13 22:53:44,231 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 22:53:44,232 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 22:53:44,232 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 22:53:44,232 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 22:53:44,247 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:53:44" (1/1) ... [2019-01-13 22:53:44,247 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:53:44" (1/1) ... [2019-01-13 22:53:44,262 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:53:44" (1/1) ... [2019-01-13 22:53:44,263 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:53:44" (1/1) ... [2019-01-13 22:53:44,278 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:53:44" (1/1) ... [2019-01-13 22:53:44,283 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:53:44" (1/1) ... [2019-01-13 22:53:44,286 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:53:44" (1/1) ... [2019-01-13 22:53:44,301 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 22:53:44,302 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 22:53:44,302 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 22:53:44,302 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 22:53:44,306 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:53:44" (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-13 22:53:44,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-13 22:53:44,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 22:53:44,360 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-13 22:53:44,360 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-13 22:53:44,361 INFO L138 BoogieDeclarations]: Found implementation of procedure test_fun [2019-01-13 22:53:44,361 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-13 22:53:44,361 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-13 22:53:44,361 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-13 22:53:44,361 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-13 22:53:44,361 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-13 22:53:44,362 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-13 22:53:44,362 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-13 22:53:44,363 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-13 22:53:44,363 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-13 22:53:44,363 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-13 22:53:44,363 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-13 22:53:44,364 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-13 22:53:44,364 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-13 22:53:44,364 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-13 22:53:44,364 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-13 22:53:44,364 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-13 22:53:44,364 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-13 22:53:44,364 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-13 22:53:44,364 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-13 22:53:44,365 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-13 22:53:44,366 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-13 22:53:44,366 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-13 22:53:44,366 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-13 22:53:44,366 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-13 22:53:44,366 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-13 22:53:44,366 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-13 22:53:44,367 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-13 22:53:44,367 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-13 22:53:44,367 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-13 22:53:44,367 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-13 22:53:44,367 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-13 22:53:44,367 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-13 22:53:44,367 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-13 22:53:44,367 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-13 22:53:44,368 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-13 22:53:44,369 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-13 22:53:44,369 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-13 22:53:44,369 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-13 22:53:44,370 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-13 22:53:44,370 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-13 22:53:44,370 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-13 22:53:44,370 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-13 22:53:44,370 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-13 22:53:44,370 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-13 22:53:44,370 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-13 22:53:44,370 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-13 22:53:44,371 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-13 22:53:44,372 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-13 22:53:44,372 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-13 22:53:44,372 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-13 22:53:44,372 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-13 22:53:44,372 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-13 22:53:44,373 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-13 22:53:44,373 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-13 22:53:44,374 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-13 22:53:44,374 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-13 22:53:44,374 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-13 22:53:44,374 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-13 22:53:44,374 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-13 22:53:44,374 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-13 22:53:44,374 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-13 22:53:44,375 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-13 22:53:44,375 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-13 22:53:44,375 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-13 22:53:44,375 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-13 22:53:44,375 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-13 22:53:44,375 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-13 22:53:44,375 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-13 22:53:44,375 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-13 22:53:44,376 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-13 22:53:44,377 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-13 22:53:44,378 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-13 22:53:44,378 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-13 22:53:44,378 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-13 22:53:44,378 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-13 22:53:44,378 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-13 22:53:44,378 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-13 22:53:44,378 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-13 22:53:44,379 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-13 22:53:44,380 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-13 22:53:44,380 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-13 22:53:44,380 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-13 22:53:44,380 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-13 22:53:44,380 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-13 22:53:44,380 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-13 22:53:44,380 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-13 22:53:44,381 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-13 22:53:44,381 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-13 22:53:44,381 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-13 22:53:44,381 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-13 22:53:44,381 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-13 22:53:44,381 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-13 22:53:44,381 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-13 22:53:44,381 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-13 22:53:44,382 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-13 22:53:44,383 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-13 22:53:44,383 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-13 22:53:44,384 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-13 22:53:44,384 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-13 22:53:44,384 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-13 22:53:44,384 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-13 22:53:44,384 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-13 22:53:44,384 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-13 22:53:44,384 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-13 22:53:44,384 INFO L130 BoogieDeclarations]: Found specification of procedure test_fun [2019-01-13 22:53:44,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 22:53:44,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 22:53:44,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-13 22:53:44,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 22:53:44,386 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-13 22:53:44,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-13 22:53:44,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 22:53:45,126 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 22:53:45,126 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-01-13 22:53:45,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 10:53:45 BoogieIcfgContainer [2019-01-13 22:53:45,128 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 22:53:45,128 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 22:53:45,129 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 22:53:45,133 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 22:53:45,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 10:53:43" (1/3) ... [2019-01-13 22:53:45,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fb9a325 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 10:53:45, skipping insertion in model container [2019-01-13 22:53:45,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:53:44" (2/3) ... [2019-01-13 22:53:45,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fb9a325 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 10:53:45, skipping insertion in model container [2019-01-13 22:53:45,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 10:53:45" (3/3) ... [2019-01-13 22:53:45,140 INFO L112 eAbstractionObserver]: Analyzing ICFG c.03-alloca_true-valid-memsafety.i [2019-01-13 22:53:45,150 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 22:53:45,161 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 31 error locations. [2019-01-13 22:53:45,179 INFO L257 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2019-01-13 22:53:45,206 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 22:53:45,207 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 22:53:45,207 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-13 22:53:45,207 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 22:53:45,208 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 22:53:45,208 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 22:53:45,208 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 22:53:45,208 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 22:53:45,209 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 22:53:45,227 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states. [2019-01-13 22:53:45,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-13 22:53:45,238 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:53:45,239 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:53:45,241 INFO L423 AbstractCegarLoop]: === Iteration 1 === [test_funErr19REQUIRES_VIOLATION, test_funErr20REQUIRES_VIOLATION, test_funErr16REQUIRES_VIOLATION, test_funErr17REQUIRES_VIOLATION, test_funErr18REQUIRES_VIOLATION, test_funErr3REQUIRES_VIOLATION, test_funErr24REQUIRES_VIOLATION, test_funErr4REQUIRES_VIOLATION, test_funErr26REQUIRES_VIOLATION, test_funErr25REQUIRES_VIOLATION, test_funErr0REQUIRES_VIOLATION, test_funErr21REQUIRES_VIOLATION, test_funErr22REQUIRES_VIOLATION, test_funErr1REQUIRES_VIOLATION, test_funErr2REQUIRES_VIOLATION, test_funErr23REQUIRES_VIOLATION, test_funErr8REQUIRES_VIOLATION, test_funErr29REQUIRES_VIOLATION, test_funErr9REQUIRES_VIOLATION, test_funErr10REQUIRES_VIOLATION, test_funErr27REQUIRES_VIOLATION, test_funErr5REQUIRES_VIOLATION, test_funErr6REQUIRES_VIOLATION, test_funErr7REQUIRES_VIOLATION, test_funErr28REQUIRES_VIOLATION, test_funErr13REQUIRES_VIOLATION, test_funErr14REQUIRES_VIOLATION, test_funErr15REQUIRES_VIOLATION, test_funErr11REQUIRES_VIOLATION, test_funErr12REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-13 22:53:45,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:53:45,249 INFO L82 PathProgramCache]: Analyzing trace with hash 889529511, now seen corresponding path program 1 times [2019-01-13 22:53:45,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:53:45,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:53:45,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:53:45,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:53:45,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:53:45,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:53:45,488 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-13 22:53:45,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:53:45,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 22:53:45,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 22:53:45,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 22:53:45,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:53:45,507 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 3 states. [2019-01-13 22:53:45,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:53:45,776 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2019-01-13 22:53:45,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 22:53:45,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-01-13 22:53:45,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:53:45,787 INFO L225 Difference]: With dead ends: 62 [2019-01-13 22:53:45,787 INFO L226 Difference]: Without dead ends: 59 [2019-01-13 22:53:45,789 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-13 22:53:45,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-13 22:53:45,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-01-13 22:53:45,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-13 22:53:45,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-01-13 22:53:45,833 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 9 [2019-01-13 22:53:45,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:53:45,834 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-01-13 22:53:45,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 22:53:45,834 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-01-13 22:53:45,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-13 22:53:45,834 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:53:45,835 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:53:45,835 INFO L423 AbstractCegarLoop]: === Iteration 2 === [test_funErr19REQUIRES_VIOLATION, test_funErr20REQUIRES_VIOLATION, test_funErr16REQUIRES_VIOLATION, test_funErr17REQUIRES_VIOLATION, test_funErr18REQUIRES_VIOLATION, test_funErr3REQUIRES_VIOLATION, test_funErr24REQUIRES_VIOLATION, test_funErr4REQUIRES_VIOLATION, test_funErr26REQUIRES_VIOLATION, test_funErr25REQUIRES_VIOLATION, test_funErr0REQUIRES_VIOLATION, test_funErr21REQUIRES_VIOLATION, test_funErr22REQUIRES_VIOLATION, test_funErr1REQUIRES_VIOLATION, test_funErr2REQUIRES_VIOLATION, test_funErr23REQUIRES_VIOLATION, test_funErr8REQUIRES_VIOLATION, test_funErr29REQUIRES_VIOLATION, test_funErr9REQUIRES_VIOLATION, test_funErr10REQUIRES_VIOLATION, test_funErr27REQUIRES_VIOLATION, test_funErr5REQUIRES_VIOLATION, test_funErr6REQUIRES_VIOLATION, test_funErr7REQUIRES_VIOLATION, test_funErr28REQUIRES_VIOLATION, test_funErr13REQUIRES_VIOLATION, test_funErr14REQUIRES_VIOLATION, test_funErr15REQUIRES_VIOLATION, test_funErr11REQUIRES_VIOLATION, test_funErr12REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-13 22:53:45,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:53:45,836 INFO L82 PathProgramCache]: Analyzing trace with hash 889529512, now seen corresponding path program 1 times [2019-01-13 22:53:45,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:53:45,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:53:45,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:53:45,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:53:45,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:53:45,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:53:45,955 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-13 22:53:45,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:53:45,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 22:53:45,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 22:53:45,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 22:53:45,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:53:45,958 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 3 states. [2019-01-13 22:53:46,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:53:46,103 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2019-01-13 22:53:46,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 22:53:46,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-01-13 22:53:46,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:53:46,105 INFO L225 Difference]: With dead ends: 54 [2019-01-13 22:53:46,106 INFO L226 Difference]: Without dead ends: 54 [2019-01-13 22:53:46,107 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-13 22:53:46,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-13 22:53:46,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-01-13 22:53:46,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-13 22:53:46,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2019-01-13 22:53:46,114 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 9 [2019-01-13 22:53:46,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:53:46,114 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2019-01-13 22:53:46,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 22:53:46,115 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2019-01-13 22:53:46,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-13 22:53:46,115 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:53:46,115 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:53:46,116 INFO L423 AbstractCegarLoop]: === Iteration 3 === [test_funErr19REQUIRES_VIOLATION, test_funErr20REQUIRES_VIOLATION, test_funErr16REQUIRES_VIOLATION, test_funErr17REQUIRES_VIOLATION, test_funErr18REQUIRES_VIOLATION, test_funErr3REQUIRES_VIOLATION, test_funErr24REQUIRES_VIOLATION, test_funErr4REQUIRES_VIOLATION, test_funErr26REQUIRES_VIOLATION, test_funErr25REQUIRES_VIOLATION, test_funErr0REQUIRES_VIOLATION, test_funErr21REQUIRES_VIOLATION, test_funErr22REQUIRES_VIOLATION, test_funErr1REQUIRES_VIOLATION, test_funErr2REQUIRES_VIOLATION, test_funErr23REQUIRES_VIOLATION, test_funErr8REQUIRES_VIOLATION, test_funErr29REQUIRES_VIOLATION, test_funErr9REQUIRES_VIOLATION, test_funErr10REQUIRES_VIOLATION, test_funErr27REQUIRES_VIOLATION, test_funErr5REQUIRES_VIOLATION, test_funErr6REQUIRES_VIOLATION, test_funErr7REQUIRES_VIOLATION, test_funErr28REQUIRES_VIOLATION, test_funErr13REQUIRES_VIOLATION, test_funErr14REQUIRES_VIOLATION, test_funErr15REQUIRES_VIOLATION, test_funErr11REQUIRES_VIOLATION, test_funErr12REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-13 22:53:46,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:53:46,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1805611050, now seen corresponding path program 1 times [2019-01-13 22:53:46,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:53:46,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:53:46,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:53:46,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:53:46,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:53:46,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:53:46,220 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-13 22:53:46,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:53:46,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 22:53:46,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 22:53:46,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 22:53:46,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:53:46,222 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 3 states. [2019-01-13 22:53:46,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:53:46,320 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2019-01-13 22:53:46,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 22:53:46,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-13 22:53:46,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:53:46,324 INFO L225 Difference]: With dead ends: 52 [2019-01-13 22:53:46,324 INFO L226 Difference]: Without dead ends: 52 [2019-01-13 22:53:46,324 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-13 22:53:46,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-13 22:53:46,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-01-13 22:53:46,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-13 22:53:46,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2019-01-13 22:53:46,332 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 10 [2019-01-13 22:53:46,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:53:46,333 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2019-01-13 22:53:46,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 22:53:46,334 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2019-01-13 22:53:46,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-13 22:53:46,334 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:53:46,335 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:53:46,335 INFO L423 AbstractCegarLoop]: === Iteration 4 === [test_funErr19REQUIRES_VIOLATION, test_funErr20REQUIRES_VIOLATION, test_funErr16REQUIRES_VIOLATION, test_funErr17REQUIRES_VIOLATION, test_funErr18REQUIRES_VIOLATION, test_funErr3REQUIRES_VIOLATION, test_funErr24REQUIRES_VIOLATION, test_funErr4REQUIRES_VIOLATION, test_funErr26REQUIRES_VIOLATION, test_funErr25REQUIRES_VIOLATION, test_funErr0REQUIRES_VIOLATION, test_funErr21REQUIRES_VIOLATION, test_funErr22REQUIRES_VIOLATION, test_funErr1REQUIRES_VIOLATION, test_funErr2REQUIRES_VIOLATION, test_funErr23REQUIRES_VIOLATION, test_funErr8REQUIRES_VIOLATION, test_funErr29REQUIRES_VIOLATION, test_funErr9REQUIRES_VIOLATION, test_funErr10REQUIRES_VIOLATION, test_funErr27REQUIRES_VIOLATION, test_funErr5REQUIRES_VIOLATION, test_funErr6REQUIRES_VIOLATION, test_funErr7REQUIRES_VIOLATION, test_funErr28REQUIRES_VIOLATION, test_funErr13REQUIRES_VIOLATION, test_funErr14REQUIRES_VIOLATION, test_funErr15REQUIRES_VIOLATION, test_funErr11REQUIRES_VIOLATION, test_funErr12REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-13 22:53:46,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:53:46,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1805611051, now seen corresponding path program 1 times [2019-01-13 22:53:46,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:53:46,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:53:46,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:53:46,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:53:46,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:53:46,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:53:46,518 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-13 22:53:46,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:53:46,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 22:53:46,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 22:53:46,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 22:53:46,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:53:46,520 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 3 states. [2019-01-13 22:53:46,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:53:46,740 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2019-01-13 22:53:46,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 22:53:46,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-13 22:53:46,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:53:46,744 INFO L225 Difference]: With dead ends: 50 [2019-01-13 22:53:46,744 INFO L226 Difference]: Without dead ends: 50 [2019-01-13 22:53:46,744 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-13 22:53:46,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-13 22:53:46,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-01-13 22:53:46,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-13 22:53:46,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2019-01-13 22:53:46,751 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 10 [2019-01-13 22:53:46,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:53:46,751 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2019-01-13 22:53:46,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 22:53:46,751 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2019-01-13 22:53:46,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-13 22:53:46,752 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:53:46,752 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:53:46,752 INFO L423 AbstractCegarLoop]: === Iteration 5 === [test_funErr19REQUIRES_VIOLATION, test_funErr20REQUIRES_VIOLATION, test_funErr16REQUIRES_VIOLATION, test_funErr17REQUIRES_VIOLATION, test_funErr18REQUIRES_VIOLATION, test_funErr3REQUIRES_VIOLATION, test_funErr24REQUIRES_VIOLATION, test_funErr4REQUIRES_VIOLATION, test_funErr26REQUIRES_VIOLATION, test_funErr25REQUIRES_VIOLATION, test_funErr0REQUIRES_VIOLATION, test_funErr21REQUIRES_VIOLATION, test_funErr22REQUIRES_VIOLATION, test_funErr1REQUIRES_VIOLATION, test_funErr2REQUIRES_VIOLATION, test_funErr23REQUIRES_VIOLATION, test_funErr8REQUIRES_VIOLATION, test_funErr29REQUIRES_VIOLATION, test_funErr9REQUIRES_VIOLATION, test_funErr10REQUIRES_VIOLATION, test_funErr27REQUIRES_VIOLATION, test_funErr5REQUIRES_VIOLATION, test_funErr6REQUIRES_VIOLATION, test_funErr7REQUIRES_VIOLATION, test_funErr28REQUIRES_VIOLATION, test_funErr13REQUIRES_VIOLATION, test_funErr14REQUIRES_VIOLATION, test_funErr15REQUIRES_VIOLATION, test_funErr11REQUIRES_VIOLATION, test_funErr12REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-13 22:53:46,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:53:46,753 INFO L82 PathProgramCache]: Analyzing trace with hash 139367690, now seen corresponding path program 1 times [2019-01-13 22:53:46,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:53:46,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:53:46,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:53:46,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:53:46,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:53:46,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:53:46,802 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-13 22:53:46,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:53:46,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 22:53:46,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 22:53:46,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 22:53:46,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:53:46,803 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 3 states. [2019-01-13 22:53:46,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:53:46,893 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2019-01-13 22:53:46,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 22:53:46,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-01-13 22:53:46,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:53:46,897 INFO L225 Difference]: With dead ends: 46 [2019-01-13 22:53:46,897 INFO L226 Difference]: Without dead ends: 46 [2019-01-13 22:53:46,897 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-13 22:53:46,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-13 22:53:46,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-01-13 22:53:46,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-13 22:53:46,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2019-01-13 22:53:46,903 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 11 [2019-01-13 22:53:46,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:53:46,903 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2019-01-13 22:53:46,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 22:53:46,903 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2019-01-13 22:53:46,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-13 22:53:46,904 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:53:46,904 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:53:46,904 INFO L423 AbstractCegarLoop]: === Iteration 6 === [test_funErr19REQUIRES_VIOLATION, test_funErr20REQUIRES_VIOLATION, test_funErr16REQUIRES_VIOLATION, test_funErr17REQUIRES_VIOLATION, test_funErr18REQUIRES_VIOLATION, test_funErr3REQUIRES_VIOLATION, test_funErr24REQUIRES_VIOLATION, test_funErr4REQUIRES_VIOLATION, test_funErr26REQUIRES_VIOLATION, test_funErr25REQUIRES_VIOLATION, test_funErr0REQUIRES_VIOLATION, test_funErr21REQUIRES_VIOLATION, test_funErr22REQUIRES_VIOLATION, test_funErr1REQUIRES_VIOLATION, test_funErr2REQUIRES_VIOLATION, test_funErr23REQUIRES_VIOLATION, test_funErr8REQUIRES_VIOLATION, test_funErr29REQUIRES_VIOLATION, test_funErr9REQUIRES_VIOLATION, test_funErr10REQUIRES_VIOLATION, test_funErr27REQUIRES_VIOLATION, test_funErr5REQUIRES_VIOLATION, test_funErr6REQUIRES_VIOLATION, test_funErr7REQUIRES_VIOLATION, test_funErr28REQUIRES_VIOLATION, test_funErr13REQUIRES_VIOLATION, test_funErr14REQUIRES_VIOLATION, test_funErr15REQUIRES_VIOLATION, test_funErr11REQUIRES_VIOLATION, test_funErr12REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-13 22:53:46,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:53:46,905 INFO L82 PathProgramCache]: Analyzing trace with hash 139367691, now seen corresponding path program 1 times [2019-01-13 22:53:46,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:53:46,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:53:46,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:53:46,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:53:46,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:53:46,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:53:46,959 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-13 22:53:46,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:53:46,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 22:53:46,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 22:53:46,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 22:53:46,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:53:46,961 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 3 states. [2019-01-13 22:53:47,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:53:47,031 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2019-01-13 22:53:47,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 22:53:47,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-01-13 22:53:47,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:53:47,033 INFO L225 Difference]: With dead ends: 42 [2019-01-13 22:53:47,033 INFO L226 Difference]: Without dead ends: 42 [2019-01-13 22:53:47,033 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-13 22:53:47,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-13 22:53:47,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-01-13 22:53:47,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-13 22:53:47,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2019-01-13 22:53:47,040 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 11 [2019-01-13 22:53:47,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:53:47,040 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2019-01-13 22:53:47,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 22:53:47,040 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2019-01-13 22:53:47,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-13 22:53:47,041 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:53:47,041 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:53:47,041 INFO L423 AbstractCegarLoop]: === Iteration 7 === [test_funErr19REQUIRES_VIOLATION, test_funErr20REQUIRES_VIOLATION, test_funErr16REQUIRES_VIOLATION, test_funErr17REQUIRES_VIOLATION, test_funErr18REQUIRES_VIOLATION, test_funErr3REQUIRES_VIOLATION, test_funErr24REQUIRES_VIOLATION, test_funErr4REQUIRES_VIOLATION, test_funErr26REQUIRES_VIOLATION, test_funErr25REQUIRES_VIOLATION, test_funErr0REQUIRES_VIOLATION, test_funErr21REQUIRES_VIOLATION, test_funErr22REQUIRES_VIOLATION, test_funErr1REQUIRES_VIOLATION, test_funErr2REQUIRES_VIOLATION, test_funErr23REQUIRES_VIOLATION, test_funErr8REQUIRES_VIOLATION, test_funErr29REQUIRES_VIOLATION, test_funErr9REQUIRES_VIOLATION, test_funErr10REQUIRES_VIOLATION, test_funErr27REQUIRES_VIOLATION, test_funErr5REQUIRES_VIOLATION, test_funErr6REQUIRES_VIOLATION, test_funErr7REQUIRES_VIOLATION, test_funErr28REQUIRES_VIOLATION, test_funErr13REQUIRES_VIOLATION, test_funErr14REQUIRES_VIOLATION, test_funErr15REQUIRES_VIOLATION, test_funErr11REQUIRES_VIOLATION, test_funErr12REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-13 22:53:47,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:53:47,042 INFO L82 PathProgramCache]: Analyzing trace with hash 25431085, now seen corresponding path program 1 times [2019-01-13 22:53:47,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:53:47,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:53:47,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:53:47,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:53:47,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:53:47,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:53:47,079 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-13 22:53:47,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:53:47,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 22:53:47,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 22:53:47,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 22:53:47,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:53:47,082 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 3 states. [2019-01-13 22:53:47,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:53:47,159 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2019-01-13 22:53:47,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 22:53:47,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-01-13 22:53:47,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:53:47,162 INFO L225 Difference]: With dead ends: 38 [2019-01-13 22:53:47,162 INFO L226 Difference]: Without dead ends: 38 [2019-01-13 22:53:47,163 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-13 22:53:47,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-13 22:53:47,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-01-13 22:53:47,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-13 22:53:47,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-01-13 22:53:47,167 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 12 [2019-01-13 22:53:47,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:53:47,167 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-01-13 22:53:47,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 22:53:47,167 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-01-13 22:53:47,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-13 22:53:47,168 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:53:47,168 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:53:47,168 INFO L423 AbstractCegarLoop]: === Iteration 8 === [test_funErr19REQUIRES_VIOLATION, test_funErr20REQUIRES_VIOLATION, test_funErr16REQUIRES_VIOLATION, test_funErr17REQUIRES_VIOLATION, test_funErr18REQUIRES_VIOLATION, test_funErr3REQUIRES_VIOLATION, test_funErr24REQUIRES_VIOLATION, test_funErr4REQUIRES_VIOLATION, test_funErr26REQUIRES_VIOLATION, test_funErr25REQUIRES_VIOLATION, test_funErr0REQUIRES_VIOLATION, test_funErr21REQUIRES_VIOLATION, test_funErr22REQUIRES_VIOLATION, test_funErr1REQUIRES_VIOLATION, test_funErr2REQUIRES_VIOLATION, test_funErr23REQUIRES_VIOLATION, test_funErr8REQUIRES_VIOLATION, test_funErr29REQUIRES_VIOLATION, test_funErr9REQUIRES_VIOLATION, test_funErr10REQUIRES_VIOLATION, test_funErr27REQUIRES_VIOLATION, test_funErr5REQUIRES_VIOLATION, test_funErr6REQUIRES_VIOLATION, test_funErr7REQUIRES_VIOLATION, test_funErr28REQUIRES_VIOLATION, test_funErr13REQUIRES_VIOLATION, test_funErr14REQUIRES_VIOLATION, test_funErr15REQUIRES_VIOLATION, test_funErr11REQUIRES_VIOLATION, test_funErr12REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-13 22:53:47,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:53:47,169 INFO L82 PathProgramCache]: Analyzing trace with hash 25431086, now seen corresponding path program 1 times [2019-01-13 22:53:47,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:53:47,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:53:47,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:53:47,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:53:47,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:53:47,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:53:47,243 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-13 22:53:47,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:53:47,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 22:53:47,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 22:53:47,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 22:53:47,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:53:47,245 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 3 states. [2019-01-13 22:53:47,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:53:47,292 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2019-01-13 22:53:47,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 22:53:47,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-01-13 22:53:47,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:53:47,294 INFO L225 Difference]: With dead ends: 34 [2019-01-13 22:53:47,294 INFO L226 Difference]: Without dead ends: 34 [2019-01-13 22:53:47,295 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-13 22:53:47,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-13 22:53:47,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-01-13 22:53:47,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-13 22:53:47,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2019-01-13 22:53:47,300 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 12 [2019-01-13 22:53:47,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:53:47,300 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2019-01-13 22:53:47,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 22:53:47,300 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2019-01-13 22:53:47,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-13 22:53:47,301 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:53:47,301 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-13 22:53:47,302 INFO L423 AbstractCegarLoop]: === Iteration 9 === [test_funErr19REQUIRES_VIOLATION, test_funErr20REQUIRES_VIOLATION, test_funErr16REQUIRES_VIOLATION, test_funErr17REQUIRES_VIOLATION, test_funErr18REQUIRES_VIOLATION, test_funErr3REQUIRES_VIOLATION, test_funErr24REQUIRES_VIOLATION, test_funErr4REQUIRES_VIOLATION, test_funErr26REQUIRES_VIOLATION, test_funErr25REQUIRES_VIOLATION, test_funErr0REQUIRES_VIOLATION, test_funErr21REQUIRES_VIOLATION, test_funErr22REQUIRES_VIOLATION, test_funErr1REQUIRES_VIOLATION, test_funErr2REQUIRES_VIOLATION, test_funErr23REQUIRES_VIOLATION, test_funErr8REQUIRES_VIOLATION, test_funErr29REQUIRES_VIOLATION, test_funErr9REQUIRES_VIOLATION, test_funErr10REQUIRES_VIOLATION, test_funErr27REQUIRES_VIOLATION, test_funErr5REQUIRES_VIOLATION, test_funErr6REQUIRES_VIOLATION, test_funErr7REQUIRES_VIOLATION, test_funErr28REQUIRES_VIOLATION, test_funErr13REQUIRES_VIOLATION, test_funErr14REQUIRES_VIOLATION, test_funErr15REQUIRES_VIOLATION, test_funErr11REQUIRES_VIOLATION, test_funErr12REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-13 22:53:47,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:53:47,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1586130209, now seen corresponding path program 1 times [2019-01-13 22:53:47,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:53:47,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:53:47,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:53:47,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:53:47,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:53:47,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:53:47,703 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-01-13 22:53:47,825 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-01-13 22:53:47,857 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-13 22:53:47,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:53:47,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 22:53:47,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 22:53:47,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 22:53:47,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 22:53:47,858 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 5 states. [2019-01-13 22:53:48,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:53:48,011 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-01-13 22:53:48,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 22:53:48,011 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-01-13 22:53:48,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:53:48,012 INFO L225 Difference]: With dead ends: 33 [2019-01-13 22:53:48,012 INFO L226 Difference]: Without dead ends: 0 [2019-01-13 22:53:48,013 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-13 22:53:48,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-13 22:53:48,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-13 22:53:48,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-13 22:53:48,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-13 22:53:48,014 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-01-13 22:53:48,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:53:48,015 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-13 22:53:48,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 22:53:48,015 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-13 22:53:48,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-13 22:53:48,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 10:53:48 BoogieIcfgContainer [2019-01-13 22:53:48,024 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 22:53:48,024 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 22:53:48,024 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 22:53:48,025 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 22:53:48,025 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 10:53:45" (3/4) ... [2019-01-13 22:53:48,029 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-13 22:53:48,035 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-13 22:53:48,035 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-01-13 22:53:48,035 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure test_fun [2019-01-13 22:53:48,035 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-01-13 22:53:48,036 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-13 22:53:48,041 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2019-01-13 22:53:48,042 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-01-13 22:53:48,042 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-13 22:53:48,104 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 22:53:48,104 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 22:53:48,105 INFO L168 Benchmark]: Toolchain (without parser) took 4556.81 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 948.7 MB in the beginning and 889.7 MB in the end (delta: 59.0 MB). Peak memory consumption was 177.5 MB. Max. memory is 11.5 GB. [2019-01-13 22:53:48,106 INFO L168 Benchmark]: CDTParser took 0.15 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-13 22:53:48,107 INFO L168 Benchmark]: CACSL2BoogieTranslator took 681.41 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -144.2 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. [2019-01-13 22:53:48,107 INFO L168 Benchmark]: Boogie Preprocessor took 69.26 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 22:53:48,108 INFO L168 Benchmark]: RCFGBuilder took 826.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 52.2 MB). Peak memory consumption was 52.2 MB. Max. memory is 11.5 GB. [2019-01-13 22:53:48,108 INFO L168 Benchmark]: TraceAbstraction took 2895.38 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 889.7 MB in the end (delta: 151.0 MB). Peak memory consumption was 151.0 MB. Max. memory is 11.5 GB. [2019-01-13 22:53:48,109 INFO L168 Benchmark]: Witness Printer took 79.88 ms. Allocated memory is still 1.1 GB. Free memory is still 889.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 22:53:48,112 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.15 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 681.41 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -144.2 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 69.26 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 826.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 52.2 MB). Peak memory consumption was 52.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2895.38 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 889.7 MB in the end (delta: 151.0 MB). Peak memory consumption was 151.0 MB. Max. memory is 11.5 GB. * Witness Printer took 79.88 ms. Allocated memory is still 1.1 GB. Free memory is still 889.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: 552]: 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: 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: 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: 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: 556]: 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: 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: 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: 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: 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: 549]: 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: 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: 551]: 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, 2.8s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 218 SDtfs, 297 SDslu, 93 SDs, 0 SdLazy, 248 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s 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...