./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memory-alloca/c.03-alloca-2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -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 ../sv-benchmarks/c/memory-alloca/c.03-alloca-2.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 ab87ef7cc863b18816ae397a50b6c6e9fb3e753d ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 00:59:56,963 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 00:59:56,966 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 00:59:56,980 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 00:59:56,980 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 00:59:56,982 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 00:59:56,983 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 00:59:56,986 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 00:59:56,988 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 00:59:56,989 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 00:59:56,990 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 00:59:56,992 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 00:59:56,992 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 00:59:56,993 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 00:59:56,994 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 00:59:56,996 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 00:59:56,997 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 00:59:56,998 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 00:59:57,000 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 00:59:57,003 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 00:59:57,005 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 00:59:57,006 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 00:59:57,007 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 00:59:57,008 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 00:59:57,011 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 00:59:57,012 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 00:59:57,012 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 00:59:57,013 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 00:59:57,014 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 00:59:57,015 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 00:59:57,015 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 00:59:57,016 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 00:59:57,017 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 00:59:57,018 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 00:59:57,019 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 00:59:57,020 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 00:59:57,021 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 00:59:57,021 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 00:59:57,021 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 00:59:57,022 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 00:59:57,023 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 00:59:57,024 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2020-07-29 00:59:57,040 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 00:59:57,041 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 00:59:57,042 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 00:59:57,042 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 00:59:57,043 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 00:59:57,043 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 00:59:57,043 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 00:59:57,044 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 00:59:57,044 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 00:59:57,044 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 00:59:57,045 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 00:59:57,045 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-07-29 00:59:57,045 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-07-29 00:59:57,045 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-07-29 00:59:57,046 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-29 00:59:57,046 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-07-29 00:59:57,046 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 00:59:57,047 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 00:59:57,047 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 00:59:57,047 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 00:59:57,047 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-29 00:59:57,048 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-29 00:59:57,048 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 00:59:57,048 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 00:59:57,049 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-29 00:59:57,049 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 00:59:57,049 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-29 00:59:57,049 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 00:59:57,050 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> ab87ef7cc863b18816ae397a50b6c6e9fb3e753d [2020-07-29 00:59:57,359 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 00:59:57,378 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 00:59:57,382 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 00:59:57,383 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 00:59:57,386 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 00:59:57,387 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memory-alloca/c.03-alloca-2.i [2020-07-29 00:59:57,467 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/514776d7e/622ba45ec3e3478f95cca79163df1bf4/FLAGddffb115e [2020-07-29 00:59:58,033 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 00:59:58,034 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memory-alloca/c.03-alloca-2.i [2020-07-29 00:59:58,051 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/514776d7e/622ba45ec3e3478f95cca79163df1bf4/FLAGddffb115e [2020-07-29 00:59:58,398 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/514776d7e/622ba45ec3e3478f95cca79163df1bf4 [2020-07-29 00:59:58,402 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 00:59:58,405 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-07-29 00:59:58,407 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 00:59:58,407 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 00:59:58,410 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 00:59:58,412 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 12:59:58" (1/1) ... [2020-07-29 00:59:58,415 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@496c238a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 12:59:58, skipping insertion in model container [2020-07-29 00:59:58,415 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 12:59:58" (1/1) ... [2020-07-29 00:59:58,422 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 00:59:58,481 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 00:59:58,902 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 00:59:58,915 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 00:59:58,978 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 00:59:59,035 INFO L208 MainTranslator]: Completed translation [2020-07-29 00:59:59,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 12:59:59 WrapperNode [2020-07-29 00:59:59,036 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 00:59:59,036 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 00:59:59,037 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 00:59:59,037 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 00:59:59,048 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 12:59:59" (1/1) ... [2020-07-29 00:59:59,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 12:59:59" (1/1) ... [2020-07-29 00:59:59,064 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 12:59:59" (1/1) ... [2020-07-29 00:59:59,065 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 12:59:59" (1/1) ... [2020-07-29 00:59:59,085 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 12:59:59" (1/1) ... [2020-07-29 00:59:59,091 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 12:59:59" (1/1) ... [2020-07-29 00:59:59,095 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 12:59:59" (1/1) ... [2020-07-29 00:59:59,102 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 00:59:59,103 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 00:59:59,103 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 00:59:59,103 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 00:59:59,104 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 12:59:59" (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 [2020-07-29 00:59:59,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-29 00:59:59,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 00:59:59,179 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-07-29 00:59:59,179 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-07-29 00:59:59,180 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2020-07-29 00:59:59,180 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2020-07-29 00:59:59,180 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2020-07-29 00:59:59,180 INFO L138 BoogieDeclarations]: Found implementation of procedure test_fun [2020-07-29 00:59:59,180 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-29 00:59:59,180 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-29 00:59:59,181 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-29 00:59:59,181 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-29 00:59:59,181 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-29 00:59:59,181 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-29 00:59:59,181 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-29 00:59:59,181 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-29 00:59:59,182 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-29 00:59:59,182 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-29 00:59:59,182 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-29 00:59:59,182 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-29 00:59:59,182 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-29 00:59:59,182 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-29 00:59:59,182 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-29 00:59:59,183 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-29 00:59:59,183 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-29 00:59:59,183 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-07-29 00:59:59,183 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-07-29 00:59:59,183 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2020-07-29 00:59:59,183 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2020-07-29 00:59:59,184 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2020-07-29 00:59:59,184 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-29 00:59:59,184 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-29 00:59:59,184 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-29 00:59:59,184 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-29 00:59:59,184 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-29 00:59:59,184 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-29 00:59:59,185 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-29 00:59:59,185 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-29 00:59:59,185 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-29 00:59:59,185 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-29 00:59:59,185 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-29 00:59:59,185 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-29 00:59:59,185 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-29 00:59:59,186 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-29 00:59:59,186 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-29 00:59:59,186 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-29 00:59:59,186 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-29 00:59:59,186 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-29 00:59:59,186 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-29 00:59:59,186 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-29 00:59:59,187 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-29 00:59:59,187 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-29 00:59:59,187 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-29 00:59:59,187 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-29 00:59:59,187 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-29 00:59:59,187 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-29 00:59:59,187 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-29 00:59:59,188 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-29 00:59:59,188 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-29 00:59:59,188 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-29 00:59:59,188 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-29 00:59:59,188 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-29 00:59:59,188 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-29 00:59:59,189 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-29 00:59:59,189 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-29 00:59:59,189 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-29 00:59:59,189 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-29 00:59:59,189 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-29 00:59:59,189 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-29 00:59:59,189 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-29 00:59:59,189 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-29 00:59:59,190 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-29 00:59:59,190 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-29 00:59:59,190 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-29 00:59:59,190 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-29 00:59:59,190 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-29 00:59:59,190 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-29 00:59:59,190 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-29 00:59:59,191 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-29 00:59:59,191 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-29 00:59:59,191 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-29 00:59:59,191 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-29 00:59:59,191 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-29 00:59:59,191 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-29 00:59:59,191 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-29 00:59:59,192 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-29 00:59:59,192 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-29 00:59:59,192 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-29 00:59:59,192 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-29 00:59:59,192 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-29 00:59:59,192 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-29 00:59:59,192 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-29 00:59:59,193 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-29 00:59:59,193 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-29 00:59:59,193 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-29 00:59:59,193 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-29 00:59:59,193 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-29 00:59:59,193 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-29 00:59:59,193 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-29 00:59:59,193 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-29 00:59:59,194 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-29 00:59:59,194 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-29 00:59:59,194 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-29 00:59:59,194 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-29 00:59:59,194 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-29 00:59:59,194 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-29 00:59:59,194 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-29 00:59:59,195 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-29 00:59:59,195 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-29 00:59:59,195 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-29 00:59:59,195 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-29 00:59:59,195 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-29 00:59:59,195 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-29 00:59:59,195 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-29 00:59:59,196 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-29 00:59:59,196 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-29 00:59:59,196 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-29 00:59:59,196 INFO L130 BoogieDeclarations]: Found specification of procedure test_fun [2020-07-29 00:59:59,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 00:59:59,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 00:59:59,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 00:59:59,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 00:59:59,197 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-29 00:59:59,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-29 00:59:59,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 00:59:59,941 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 00:59:59,941 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-29 00:59:59,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 12:59:59 BoogieIcfgContainer [2020-07-29 00:59:59,946 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 00:59:59,947 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-29 00:59:59,947 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-29 00:59:59,951 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-29 00:59:59,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.07 12:59:58" (1/3) ... [2020-07-29 00:59:59,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33280d1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 12:59:59, skipping insertion in model container [2020-07-29 00:59:59,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 12:59:59" (2/3) ... [2020-07-29 00:59:59,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33280d1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 12:59:59, skipping insertion in model container [2020-07-29 00:59:59,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 12:59:59" (3/3) ... [2020-07-29 00:59:59,955 INFO L109 eAbstractionObserver]: Analyzing ICFG c.03-alloca-2.i [2020-07-29 00:59:59,966 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-29 00:59:59,974 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 31 error locations. [2020-07-29 00:59:59,990 INFO L251 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2020-07-29 01:00:00,012 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-29 01:00:00,013 INFO L376 AbstractCegarLoop]: Hoare is false [2020-07-29 01:00:00,013 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-29 01:00:00,013 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:00:00,013 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:00:00,013 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-29 01:00:00,014 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:00:00,014 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-29 01:00:00,031 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states. [2020-07-29 01:00:00,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-29 01:00:00,041 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:00:00,042 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:00:00,043 INFO L427 AbstractCegarLoop]: === Iteration 1 === [test_funErr25REQUIRES_VIOLATION, test_funErr4REQUIRES_VIOLATION, test_funErr2REQUIRES_VIOLATION, test_funErr3REQUIRES_VIOLATION, test_funErr24REQUIRES_VIOLATION, test_funErr6REQUIRES_VIOLATION, test_funErr7REQUIRES_VIOLATION, test_funErr28REQUIRES_VIOLATION, test_funErr5REQUIRES_VIOLATION, test_funErr26REQUIRES_VIOLATION, test_funErr27REQUIRES_VIOLATION, test_funErr20REQUIRES_VIOLATION, test_funErr18REQUIRES_VIOLATION, test_funErr19REQUIRES_VIOLATION, test_funErr1REQUIRES_VIOLATION, test_funErr22REQUIRES_VIOLATION, test_funErr23REQUIRES_VIOLATION, test_funErr21REQUIRES_VIOLATION, test_funErr0REQUIRES_VIOLATION, test_funErr14REQUIRES_VIOLATION, test_funErr15REQUIRES_VIOLATION, test_funErr13REQUIRES_VIOLATION, test_funErr17REQUIRES_VIOLATION, test_funErr16REQUIRES_VIOLATION, test_funErr9REQUIRES_VIOLATION, test_funErr29REQUIRES_VIOLATION, test_funErr8REQUIRES_VIOLATION, test_funErr12REQUIRES_VIOLATION, test_funErr10REQUIRES_VIOLATION, test_funErr11REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-07-29 01:00:00,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:00:00,050 INFO L82 PathProgramCache]: Analyzing trace with hash 743499951, now seen corresponding path program 1 times [2020-07-29 01:00:00,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:00:00,062 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060107837] [2020-07-29 01:00:00,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:00:00,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:00,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:00:00,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:00,345 INFO L280 TraceCheckUtils]: 0: Hoare triple {76#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {70#true} is VALID [2020-07-29 01:00:00,345 INFO L280 TraceCheckUtils]: 1: Hoare triple {70#true} assume true; {70#true} is VALID [2020-07-29 01:00:00,346 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {70#true} {70#true} #92#return; {70#true} is VALID [2020-07-29 01:00:00,357 INFO L263 TraceCheckUtils]: 0: Hoare triple {70#true} call ULTIMATE.init(); {76#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:00:00,357 INFO L280 TraceCheckUtils]: 1: Hoare triple {76#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {70#true} is VALID [2020-07-29 01:00:00,358 INFO L280 TraceCheckUtils]: 2: Hoare triple {70#true} assume true; {70#true} is VALID [2020-07-29 01:00:00,358 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {70#true} {70#true} #92#return; {70#true} is VALID [2020-07-29 01:00:00,359 INFO L263 TraceCheckUtils]: 4: Hoare triple {70#true} call #t~ret18 := main(); {70#true} is VALID [2020-07-29 01:00:00,359 INFO L280 TraceCheckUtils]: 5: Hoare triple {70#true} assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647; {70#true} is VALID [2020-07-29 01:00:00,360 INFO L263 TraceCheckUtils]: 6: Hoare triple {70#true} call #t~ret17 := test_fun(#t~nondet14, #t~nondet15, #t~nondet16); {70#true} is VALID [2020-07-29 01:00:00,364 INFO L280 TraceCheckUtils]: 7: Hoare triple {70#true} ~x := #in~x;~y := #in~y;~z := #in~z;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnStack(4);~x_ref~0.base, ~x_ref~0.offset := #t~malloc2.base, #t~malloc2.offset;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnStack(4);~y_ref~0.base, ~y_ref~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~malloc4.base, #t~malloc4.offset := #Ultimate.allocOnStack(4);~z_ref~0.base, ~z_ref~0.offset := #t~malloc4.base, #t~malloc4.offset;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnStack(4);~c~0.base, ~c~0.offset := #t~malloc5.base, #t~malloc5.offset; {75#(= 1 (select |#valid| test_fun_~x_ref~0.base))} is VALID [2020-07-29 01:00:00,369 INFO L280 TraceCheckUtils]: 8: Hoare triple {75#(= 1 (select |#valid| test_fun_~x_ref~0.base))} assume !(1 == #valid[~x_ref~0.base]); {71#false} is VALID [2020-07-29 01:00:00,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:00:00,371 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060107837] [2020-07-29 01:00:00,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:00:00,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:00:00,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061140483] [2020-07-29 01:00:00,380 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-07-29 01:00:00,383 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:00:00,387 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:00:00,417 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:00,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:00:00,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:00:00,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:00:00,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:00:00,432 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 4 states. [2020-07-29 01:00:00,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:00,856 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2020-07-29 01:00:00,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:00:00,856 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-07-29 01:00:00,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:00:00,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:00:00,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2020-07-29 01:00:00,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:00:00,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2020-07-29 01:00:00,878 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 69 transitions. [2020-07-29 01:00:00,989 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:01,004 INFO L225 Difference]: With dead ends: 62 [2020-07-29 01:00:01,005 INFO L226 Difference]: Without dead ends: 59 [2020-07-29 01:00:01,007 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:00:01,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-07-29 01:00:01,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-07-29 01:00:01,062 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:00:01,063 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 59 states. [2020-07-29 01:00:01,063 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2020-07-29 01:00:01,063 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2020-07-29 01:00:01,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:01,078 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2020-07-29 01:00:01,079 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2020-07-29 01:00:01,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:01,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:01,080 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2020-07-29 01:00:01,081 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2020-07-29 01:00:01,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:01,095 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2020-07-29 01:00:01,095 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2020-07-29 01:00:01,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:01,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:01,097 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:00:01,097 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:00:01,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-07-29 01:00:01,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2020-07-29 01:00:01,103 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 9 [2020-07-29 01:00:01,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:00:01,103 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2020-07-29 01:00:01,103 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:00:01,103 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2020-07-29 01:00:01,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-29 01:00:01,104 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:00:01,104 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:00:01,105 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-29 01:00:01,105 INFO L427 AbstractCegarLoop]: === Iteration 2 === [test_funErr25REQUIRES_VIOLATION, test_funErr4REQUIRES_VIOLATION, test_funErr2REQUIRES_VIOLATION, test_funErr3REQUIRES_VIOLATION, test_funErr24REQUIRES_VIOLATION, test_funErr6REQUIRES_VIOLATION, test_funErr7REQUIRES_VIOLATION, test_funErr28REQUIRES_VIOLATION, test_funErr5REQUIRES_VIOLATION, test_funErr26REQUIRES_VIOLATION, test_funErr27REQUIRES_VIOLATION, test_funErr20REQUIRES_VIOLATION, test_funErr18REQUIRES_VIOLATION, test_funErr19REQUIRES_VIOLATION, test_funErr1REQUIRES_VIOLATION, test_funErr22REQUIRES_VIOLATION, test_funErr23REQUIRES_VIOLATION, test_funErr21REQUIRES_VIOLATION, test_funErr0REQUIRES_VIOLATION, test_funErr14REQUIRES_VIOLATION, test_funErr15REQUIRES_VIOLATION, test_funErr13REQUIRES_VIOLATION, test_funErr17REQUIRES_VIOLATION, test_funErr16REQUIRES_VIOLATION, test_funErr9REQUIRES_VIOLATION, test_funErr29REQUIRES_VIOLATION, test_funErr8REQUIRES_VIOLATION, test_funErr12REQUIRES_VIOLATION, test_funErr10REQUIRES_VIOLATION, test_funErr11REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-07-29 01:00:01,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:00:01,106 INFO L82 PathProgramCache]: Analyzing trace with hash 743499952, now seen corresponding path program 1 times [2020-07-29 01:00:01,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:00:01,106 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813440718] [2020-07-29 01:00:01,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:00:01,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:01,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:00:01,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:01,221 INFO L280 TraceCheckUtils]: 0: Hoare triple {324#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {318#true} is VALID [2020-07-29 01:00:01,221 INFO L280 TraceCheckUtils]: 1: Hoare triple {318#true} assume true; {318#true} is VALID [2020-07-29 01:00:01,221 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {318#true} {318#true} #92#return; {318#true} is VALID [2020-07-29 01:00:01,223 INFO L263 TraceCheckUtils]: 0: Hoare triple {318#true} call ULTIMATE.init(); {324#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:00:01,223 INFO L280 TraceCheckUtils]: 1: Hoare triple {324#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {318#true} is VALID [2020-07-29 01:00:01,224 INFO L280 TraceCheckUtils]: 2: Hoare triple {318#true} assume true; {318#true} is VALID [2020-07-29 01:00:01,224 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {318#true} {318#true} #92#return; {318#true} is VALID [2020-07-29 01:00:01,224 INFO L263 TraceCheckUtils]: 4: Hoare triple {318#true} call #t~ret18 := main(); {318#true} is VALID [2020-07-29 01:00:01,225 INFO L280 TraceCheckUtils]: 5: Hoare triple {318#true} assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647; {318#true} is VALID [2020-07-29 01:00:01,225 INFO L263 TraceCheckUtils]: 6: Hoare triple {318#true} call #t~ret17 := test_fun(#t~nondet14, #t~nondet15, #t~nondet16); {318#true} is VALID [2020-07-29 01:00:01,228 INFO L280 TraceCheckUtils]: 7: Hoare triple {318#true} ~x := #in~x;~y := #in~y;~z := #in~z;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnStack(4);~x_ref~0.base, ~x_ref~0.offset := #t~malloc2.base, #t~malloc2.offset;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnStack(4);~y_ref~0.base, ~y_ref~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~malloc4.base, #t~malloc4.offset := #Ultimate.allocOnStack(4);~z_ref~0.base, ~z_ref~0.offset := #t~malloc4.base, #t~malloc4.offset;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnStack(4);~c~0.base, ~c~0.offset := #t~malloc5.base, #t~malloc5.offset; {323#(and (= 4 (select |#length| test_fun_~x_ref~0.base)) (= test_fun_~x_ref~0.offset 0))} is VALID [2020-07-29 01:00:01,230 INFO L280 TraceCheckUtils]: 8: Hoare triple {323#(and (= 4 (select |#length| test_fun_~x_ref~0.base)) (= test_fun_~x_ref~0.offset 0))} assume !(4 + ~x_ref~0.offset <= #length[~x_ref~0.base] && 0 <= ~x_ref~0.offset); {319#false} is VALID [2020-07-29 01:00:01,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:00:01,231 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813440718] [2020-07-29 01:00:01,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:00:01,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:00:01,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540867071] [2020-07-29 01:00:01,234 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-07-29 01:00:01,234 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:00:01,234 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:00:01,249 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:01,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:00:01,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:00:01,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:00:01,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:00:01,251 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 4 states. [2020-07-29 01:00:01,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:01,589 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2020-07-29 01:00:01,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:00:01,590 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-07-29 01:00:01,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:00:01,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:00:01,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2020-07-29 01:00:01,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:00:01,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2020-07-29 01:00:01,595 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 60 transitions. [2020-07-29 01:00:01,695 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:01,697 INFO L225 Difference]: With dead ends: 54 [2020-07-29 01:00:01,700 INFO L226 Difference]: Without dead ends: 54 [2020-07-29 01:00:01,701 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:00:01,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-07-29 01:00:01,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-07-29 01:00:01,709 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:00:01,710 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 54 states. [2020-07-29 01:00:01,710 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2020-07-29 01:00:01,710 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2020-07-29 01:00:01,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:01,717 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2020-07-29 01:00:01,717 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2020-07-29 01:00:01,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:01,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:01,719 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2020-07-29 01:00:01,719 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2020-07-29 01:00:01,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:01,730 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2020-07-29 01:00:01,730 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2020-07-29 01:00:01,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:01,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:01,734 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:00:01,735 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:00:01,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-29 01:00:01,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2020-07-29 01:00:01,739 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 9 [2020-07-29 01:00:01,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:00:01,740 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2020-07-29 01:00:01,740 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:00:01,740 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2020-07-29 01:00:01,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-29 01:00:01,747 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:00:01,747 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:00:01,748 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-29 01:00:01,748 INFO L427 AbstractCegarLoop]: === Iteration 3 === [test_funErr25REQUIRES_VIOLATION, test_funErr4REQUIRES_VIOLATION, test_funErr2REQUIRES_VIOLATION, test_funErr3REQUIRES_VIOLATION, test_funErr24REQUIRES_VIOLATION, test_funErr6REQUIRES_VIOLATION, test_funErr7REQUIRES_VIOLATION, test_funErr28REQUIRES_VIOLATION, test_funErr5REQUIRES_VIOLATION, test_funErr26REQUIRES_VIOLATION, test_funErr27REQUIRES_VIOLATION, test_funErr20REQUIRES_VIOLATION, test_funErr18REQUIRES_VIOLATION, test_funErr19REQUIRES_VIOLATION, test_funErr1REQUIRES_VIOLATION, test_funErr22REQUIRES_VIOLATION, test_funErr23REQUIRES_VIOLATION, test_funErr21REQUIRES_VIOLATION, test_funErr0REQUIRES_VIOLATION, test_funErr14REQUIRES_VIOLATION, test_funErr15REQUIRES_VIOLATION, test_funErr13REQUIRES_VIOLATION, test_funErr17REQUIRES_VIOLATION, test_funErr16REQUIRES_VIOLATION, test_funErr9REQUIRES_VIOLATION, test_funErr29REQUIRES_VIOLATION, test_funErr8REQUIRES_VIOLATION, test_funErr12REQUIRES_VIOLATION, test_funErr10REQUIRES_VIOLATION, test_funErr11REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-07-29 01:00:01,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:00:01,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1573661992, now seen corresponding path program 1 times [2020-07-29 01:00:01,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:00:01,750 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092301021] [2020-07-29 01:00:01,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:00:01,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:01,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:00:01,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:01,867 INFO L280 TraceCheckUtils]: 0: Hoare triple {549#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {543#true} is VALID [2020-07-29 01:00:01,867 INFO L280 TraceCheckUtils]: 1: Hoare triple {543#true} assume true; {543#true} is VALID [2020-07-29 01:00:01,867 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {543#true} {543#true} #92#return; {543#true} is VALID [2020-07-29 01:00:01,869 INFO L263 TraceCheckUtils]: 0: Hoare triple {543#true} call ULTIMATE.init(); {549#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:00:01,869 INFO L280 TraceCheckUtils]: 1: Hoare triple {549#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {543#true} is VALID [2020-07-29 01:00:01,870 INFO L280 TraceCheckUtils]: 2: Hoare triple {543#true} assume true; {543#true} is VALID [2020-07-29 01:00:01,870 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {543#true} {543#true} #92#return; {543#true} is VALID [2020-07-29 01:00:01,870 INFO L263 TraceCheckUtils]: 4: Hoare triple {543#true} call #t~ret18 := main(); {543#true} is VALID [2020-07-29 01:00:01,871 INFO L280 TraceCheckUtils]: 5: Hoare triple {543#true} assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647; {543#true} is VALID [2020-07-29 01:00:01,871 INFO L263 TraceCheckUtils]: 6: Hoare triple {543#true} call #t~ret17 := test_fun(#t~nondet14, #t~nondet15, #t~nondet16); {543#true} is VALID [2020-07-29 01:00:01,874 INFO L280 TraceCheckUtils]: 7: Hoare triple {543#true} ~x := #in~x;~y := #in~y;~z := #in~z;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnStack(4);~x_ref~0.base, ~x_ref~0.offset := #t~malloc2.base, #t~malloc2.offset;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnStack(4);~y_ref~0.base, ~y_ref~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~malloc4.base, #t~malloc4.offset := #Ultimate.allocOnStack(4);~z_ref~0.base, ~z_ref~0.offset := #t~malloc4.base, #t~malloc4.offset;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnStack(4);~c~0.base, ~c~0.offset := #t~malloc5.base, #t~malloc5.offset; {548#(= 1 (select |#valid| test_fun_~y_ref~0.base))} is VALID [2020-07-29 01:00:01,875 INFO L280 TraceCheckUtils]: 8: Hoare triple {548#(= 1 (select |#valid| test_fun_~y_ref~0.base))} SUMMARY for call write~int(~x, ~x_ref~0.base, ~x_ref~0.offset, 4); srcloc: L518 {548#(= 1 (select |#valid| test_fun_~y_ref~0.base))} is VALID [2020-07-29 01:00:01,876 INFO L280 TraceCheckUtils]: 9: Hoare triple {548#(= 1 (select |#valid| test_fun_~y_ref~0.base))} assume !(1 == #valid[~y_ref~0.base]); {544#false} is VALID [2020-07-29 01:00:01,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:00:01,878 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092301021] [2020-07-29 01:00:01,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:00:01,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:00:01,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132020031] [2020-07-29 01:00:01,879 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-07-29 01:00:01,879 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:00:01,879 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:00:01,893 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:01,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:00:01,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:00:01,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:00:01,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:00:01,895 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 4 states. [2020-07-29 01:00:02,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:02,164 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2020-07-29 01:00:02,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:00:02,164 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-07-29 01:00:02,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:00:02,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:00:02,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2020-07-29 01:00:02,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:00:02,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2020-07-29 01:00:02,169 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 55 transitions. [2020-07-29 01:00:02,270 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:02,272 INFO L225 Difference]: With dead ends: 52 [2020-07-29 01:00:02,272 INFO L226 Difference]: Without dead ends: 52 [2020-07-29 01:00:02,273 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:00:02,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-07-29 01:00:02,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-07-29 01:00:02,304 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:00:02,304 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 52 states. [2020-07-29 01:00:02,306 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2020-07-29 01:00:02,307 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2020-07-29 01:00:02,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:02,313 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2020-07-29 01:00:02,313 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2020-07-29 01:00:02,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:02,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:02,314 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2020-07-29 01:00:02,316 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2020-07-29 01:00:02,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:02,321 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2020-07-29 01:00:02,321 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2020-07-29 01:00:02,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:02,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:02,323 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:00:02,323 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:00:02,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-29 01:00:02,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2020-07-29 01:00:02,327 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 10 [2020-07-29 01:00:02,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:00:02,327 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2020-07-29 01:00:02,329 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:00:02,330 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2020-07-29 01:00:02,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-29 01:00:02,332 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:00:02,332 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:00:02,332 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-29 01:00:02,333 INFO L427 AbstractCegarLoop]: === Iteration 4 === [test_funErr25REQUIRES_VIOLATION, test_funErr4REQUIRES_VIOLATION, test_funErr2REQUIRES_VIOLATION, test_funErr3REQUIRES_VIOLATION, test_funErr24REQUIRES_VIOLATION, test_funErr6REQUIRES_VIOLATION, test_funErr7REQUIRES_VIOLATION, test_funErr28REQUIRES_VIOLATION, test_funErr5REQUIRES_VIOLATION, test_funErr26REQUIRES_VIOLATION, test_funErr27REQUIRES_VIOLATION, test_funErr20REQUIRES_VIOLATION, test_funErr18REQUIRES_VIOLATION, test_funErr19REQUIRES_VIOLATION, test_funErr1REQUIRES_VIOLATION, test_funErr22REQUIRES_VIOLATION, test_funErr23REQUIRES_VIOLATION, test_funErr21REQUIRES_VIOLATION, test_funErr0REQUIRES_VIOLATION, test_funErr14REQUIRES_VIOLATION, test_funErr15REQUIRES_VIOLATION, test_funErr13REQUIRES_VIOLATION, test_funErr17REQUIRES_VIOLATION, test_funErr16REQUIRES_VIOLATION, test_funErr9REQUIRES_VIOLATION, test_funErr29REQUIRES_VIOLATION, test_funErr8REQUIRES_VIOLATION, test_funErr12REQUIRES_VIOLATION, test_funErr10REQUIRES_VIOLATION, test_funErr11REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-07-29 01:00:02,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:00:02,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1573661993, now seen corresponding path program 1 times [2020-07-29 01:00:02,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:00:02,335 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814511676] [2020-07-29 01:00:02,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:00:02,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:02,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:00:02,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:02,445 INFO L280 TraceCheckUtils]: 0: Hoare triple {766#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {760#true} is VALID [2020-07-29 01:00:02,445 INFO L280 TraceCheckUtils]: 1: Hoare triple {760#true} assume true; {760#true} is VALID [2020-07-29 01:00:02,446 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {760#true} {760#true} #92#return; {760#true} is VALID [2020-07-29 01:00:02,447 INFO L263 TraceCheckUtils]: 0: Hoare triple {760#true} call ULTIMATE.init(); {766#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:00:02,447 INFO L280 TraceCheckUtils]: 1: Hoare triple {766#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {760#true} is VALID [2020-07-29 01:00:02,448 INFO L280 TraceCheckUtils]: 2: Hoare triple {760#true} assume true; {760#true} is VALID [2020-07-29 01:00:02,448 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {760#true} {760#true} #92#return; {760#true} is VALID [2020-07-29 01:00:02,448 INFO L263 TraceCheckUtils]: 4: Hoare triple {760#true} call #t~ret18 := main(); {760#true} is VALID [2020-07-29 01:00:02,448 INFO L280 TraceCheckUtils]: 5: Hoare triple {760#true} assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647; {760#true} is VALID [2020-07-29 01:00:02,449 INFO L263 TraceCheckUtils]: 6: Hoare triple {760#true} call #t~ret17 := test_fun(#t~nondet14, #t~nondet15, #t~nondet16); {760#true} is VALID [2020-07-29 01:00:02,451 INFO L280 TraceCheckUtils]: 7: Hoare triple {760#true} ~x := #in~x;~y := #in~y;~z := #in~z;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnStack(4);~x_ref~0.base, ~x_ref~0.offset := #t~malloc2.base, #t~malloc2.offset;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnStack(4);~y_ref~0.base, ~y_ref~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~malloc4.base, #t~malloc4.offset := #Ultimate.allocOnStack(4);~z_ref~0.base, ~z_ref~0.offset := #t~malloc4.base, #t~malloc4.offset;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnStack(4);~c~0.base, ~c~0.offset := #t~malloc5.base, #t~malloc5.offset; {765#(and (= 4 (select |#length| test_fun_~y_ref~0.base)) (= 0 test_fun_~y_ref~0.offset))} is VALID [2020-07-29 01:00:02,453 INFO L280 TraceCheckUtils]: 8: Hoare triple {765#(and (= 4 (select |#length| test_fun_~y_ref~0.base)) (= 0 test_fun_~y_ref~0.offset))} SUMMARY for call write~int(~x, ~x_ref~0.base, ~x_ref~0.offset, 4); srcloc: L518 {765#(and (= 4 (select |#length| test_fun_~y_ref~0.base)) (= 0 test_fun_~y_ref~0.offset))} is VALID [2020-07-29 01:00:02,454 INFO L280 TraceCheckUtils]: 9: Hoare triple {765#(and (= 4 (select |#length| test_fun_~y_ref~0.base)) (= 0 test_fun_~y_ref~0.offset))} assume !(4 + ~y_ref~0.offset <= #length[~y_ref~0.base] && 0 <= ~y_ref~0.offset); {761#false} is VALID [2020-07-29 01:00:02,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:00:02,455 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814511676] [2020-07-29 01:00:02,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:00:02,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:00:02,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302629747] [2020-07-29 01:00:02,456 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-07-29 01:00:02,456 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:00:02,456 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:00:02,470 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:02,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:00:02,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:00:02,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:00:02,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:00:02,471 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 4 states. [2020-07-29 01:00:02,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:02,747 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2020-07-29 01:00:02,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:00:02,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-07-29 01:00:02,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:00:02,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:00:02,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2020-07-29 01:00:02,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:00:02,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2020-07-29 01:00:02,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 53 transitions. [2020-07-29 01:00:02,829 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:02,832 INFO L225 Difference]: With dead ends: 50 [2020-07-29 01:00:02,833 INFO L226 Difference]: Without dead ends: 50 [2020-07-29 01:00:02,833 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:00:02,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-07-29 01:00:02,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2020-07-29 01:00:02,840 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:00:02,840 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 50 states. [2020-07-29 01:00:02,840 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2020-07-29 01:00:02,842 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2020-07-29 01:00:02,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:02,844 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2020-07-29 01:00:02,845 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2020-07-29 01:00:02,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:02,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:02,847 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2020-07-29 01:00:02,847 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2020-07-29 01:00:02,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:02,850 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2020-07-29 01:00:02,850 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2020-07-29 01:00:02,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:02,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:02,851 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:00:02,851 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:00:02,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-07-29 01:00:02,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2020-07-29 01:00:02,853 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 10 [2020-07-29 01:00:02,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:00:02,853 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2020-07-29 01:00:02,853 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:00:02,854 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2020-07-29 01:00:02,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-29 01:00:02,854 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:00:02,854 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:00:02,854 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-29 01:00:02,855 INFO L427 AbstractCegarLoop]: === Iteration 5 === [test_funErr25REQUIRES_VIOLATION, test_funErr4REQUIRES_VIOLATION, test_funErr2REQUIRES_VIOLATION, test_funErr3REQUIRES_VIOLATION, test_funErr24REQUIRES_VIOLATION, test_funErr6REQUIRES_VIOLATION, test_funErr7REQUIRES_VIOLATION, test_funErr28REQUIRES_VIOLATION, test_funErr5REQUIRES_VIOLATION, test_funErr26REQUIRES_VIOLATION, test_funErr27REQUIRES_VIOLATION, test_funErr20REQUIRES_VIOLATION, test_funErr18REQUIRES_VIOLATION, test_funErr19REQUIRES_VIOLATION, test_funErr1REQUIRES_VIOLATION, test_funErr22REQUIRES_VIOLATION, test_funErr23REQUIRES_VIOLATION, test_funErr21REQUIRES_VIOLATION, test_funErr0REQUIRES_VIOLATION, test_funErr14REQUIRES_VIOLATION, test_funErr15REQUIRES_VIOLATION, test_funErr13REQUIRES_VIOLATION, test_funErr17REQUIRES_VIOLATION, test_funErr16REQUIRES_VIOLATION, test_funErr9REQUIRES_VIOLATION, test_funErr29REQUIRES_VIOLATION, test_funErr8REQUIRES_VIOLATION, test_funErr12REQUIRES_VIOLATION, test_funErr10REQUIRES_VIOLATION, test_funErr11REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-07-29 01:00:02,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:00:02,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1538881490, now seen corresponding path program 1 times [2020-07-29 01:00:02,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:00:02,856 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861143747] [2020-07-29 01:00:02,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:00:02,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:02,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:00:02,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:02,976 INFO L280 TraceCheckUtils]: 0: Hoare triple {975#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {969#true} is VALID [2020-07-29 01:00:02,977 INFO L280 TraceCheckUtils]: 1: Hoare triple {969#true} assume true; {969#true} is VALID [2020-07-29 01:00:02,977 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {969#true} {969#true} #92#return; {969#true} is VALID [2020-07-29 01:00:02,978 INFO L263 TraceCheckUtils]: 0: Hoare triple {969#true} call ULTIMATE.init(); {975#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:00:02,979 INFO L280 TraceCheckUtils]: 1: Hoare triple {975#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {969#true} is VALID [2020-07-29 01:00:02,979 INFO L280 TraceCheckUtils]: 2: Hoare triple {969#true} assume true; {969#true} is VALID [2020-07-29 01:00:02,979 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {969#true} {969#true} #92#return; {969#true} is VALID [2020-07-29 01:00:02,979 INFO L263 TraceCheckUtils]: 4: Hoare triple {969#true} call #t~ret18 := main(); {969#true} is VALID [2020-07-29 01:00:02,980 INFO L280 TraceCheckUtils]: 5: Hoare triple {969#true} assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647; {969#true} is VALID [2020-07-29 01:00:02,980 INFO L263 TraceCheckUtils]: 6: Hoare triple {969#true} call #t~ret17 := test_fun(#t~nondet14, #t~nondet15, #t~nondet16); {969#true} is VALID [2020-07-29 01:00:02,982 INFO L280 TraceCheckUtils]: 7: Hoare triple {969#true} ~x := #in~x;~y := #in~y;~z := #in~z;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnStack(4);~x_ref~0.base, ~x_ref~0.offset := #t~malloc2.base, #t~malloc2.offset;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnStack(4);~y_ref~0.base, ~y_ref~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~malloc4.base, #t~malloc4.offset := #Ultimate.allocOnStack(4);~z_ref~0.base, ~z_ref~0.offset := #t~malloc4.base, #t~malloc4.offset;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnStack(4);~c~0.base, ~c~0.offset := #t~malloc5.base, #t~malloc5.offset; {974#(= 1 (select |#valid| test_fun_~z_ref~0.base))} is VALID [2020-07-29 01:00:02,984 INFO L280 TraceCheckUtils]: 8: Hoare triple {974#(= 1 (select |#valid| test_fun_~z_ref~0.base))} SUMMARY for call write~int(~x, ~x_ref~0.base, ~x_ref~0.offset, 4); srcloc: L518 {974#(= 1 (select |#valid| test_fun_~z_ref~0.base))} is VALID [2020-07-29 01:00:02,984 INFO L280 TraceCheckUtils]: 9: Hoare triple {974#(= 1 (select |#valid| test_fun_~z_ref~0.base))} SUMMARY for call write~int(~y, ~y_ref~0.base, ~y_ref~0.offset, 4); srcloc: L518-1 {974#(= 1 (select |#valid| test_fun_~z_ref~0.base))} is VALID [2020-07-29 01:00:02,985 INFO L280 TraceCheckUtils]: 10: Hoare triple {974#(= 1 (select |#valid| test_fun_~z_ref~0.base))} assume !(1 == #valid[~z_ref~0.base]); {970#false} is VALID [2020-07-29 01:00:02,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:00:02,986 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861143747] [2020-07-29 01:00:02,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:00:02,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:00:02,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043768967] [2020-07-29 01:00:02,987 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-07-29 01:00:02,987 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:00:02,987 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:00:03,002 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:03,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:00:03,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:00:03,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:00:03,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:00:03,004 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 4 states. [2020-07-29 01:00:03,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:03,242 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2020-07-29 01:00:03,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:00:03,242 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-07-29 01:00:03,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:00:03,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:00:03,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2020-07-29 01:00:03,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:00:03,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2020-07-29 01:00:03,246 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 51 transitions. [2020-07-29 01:00:03,316 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:03,318 INFO L225 Difference]: With dead ends: 46 [2020-07-29 01:00:03,319 INFO L226 Difference]: Without dead ends: 46 [2020-07-29 01:00:03,319 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:00:03,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-29 01:00:03,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2020-07-29 01:00:03,323 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:00:03,323 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 46 states. [2020-07-29 01:00:03,323 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2020-07-29 01:00:03,323 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2020-07-29 01:00:03,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:03,325 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2020-07-29 01:00:03,325 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2020-07-29 01:00:03,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:03,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:03,326 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2020-07-29 01:00:03,326 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2020-07-29 01:00:03,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:03,329 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2020-07-29 01:00:03,329 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2020-07-29 01:00:03,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:03,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:03,329 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:00:03,329 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:00:03,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-29 01:00:03,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2020-07-29 01:00:03,332 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 11 [2020-07-29 01:00:03,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:00:03,332 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2020-07-29 01:00:03,332 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:00:03,332 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2020-07-29 01:00:03,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-29 01:00:03,333 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:00:03,333 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:00:03,333 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-29 01:00:03,333 INFO L427 AbstractCegarLoop]: === Iteration 6 === [test_funErr25REQUIRES_VIOLATION, test_funErr4REQUIRES_VIOLATION, test_funErr2REQUIRES_VIOLATION, test_funErr3REQUIRES_VIOLATION, test_funErr24REQUIRES_VIOLATION, test_funErr6REQUIRES_VIOLATION, test_funErr7REQUIRES_VIOLATION, test_funErr28REQUIRES_VIOLATION, test_funErr5REQUIRES_VIOLATION, test_funErr26REQUIRES_VIOLATION, test_funErr27REQUIRES_VIOLATION, test_funErr20REQUIRES_VIOLATION, test_funErr18REQUIRES_VIOLATION, test_funErr19REQUIRES_VIOLATION, test_funErr1REQUIRES_VIOLATION, test_funErr22REQUIRES_VIOLATION, test_funErr23REQUIRES_VIOLATION, test_funErr21REQUIRES_VIOLATION, test_funErr0REQUIRES_VIOLATION, test_funErr14REQUIRES_VIOLATION, test_funErr15REQUIRES_VIOLATION, test_funErr13REQUIRES_VIOLATION, test_funErr17REQUIRES_VIOLATION, test_funErr16REQUIRES_VIOLATION, test_funErr9REQUIRES_VIOLATION, test_funErr29REQUIRES_VIOLATION, test_funErr8REQUIRES_VIOLATION, test_funErr12REQUIRES_VIOLATION, test_funErr10REQUIRES_VIOLATION, test_funErr11REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-07-29 01:00:03,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:00:03,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1538881491, now seen corresponding path program 1 times [2020-07-29 01:00:03,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:00:03,334 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448835783] [2020-07-29 01:00:03,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:00:03,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:03,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:00:03,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:03,423 INFO L280 TraceCheckUtils]: 0: Hoare triple {1168#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1162#true} is VALID [2020-07-29 01:00:03,424 INFO L280 TraceCheckUtils]: 1: Hoare triple {1162#true} assume true; {1162#true} is VALID [2020-07-29 01:00:03,424 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1162#true} {1162#true} #92#return; {1162#true} is VALID [2020-07-29 01:00:03,425 INFO L263 TraceCheckUtils]: 0: Hoare triple {1162#true} call ULTIMATE.init(); {1168#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:00:03,426 INFO L280 TraceCheckUtils]: 1: Hoare triple {1168#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1162#true} is VALID [2020-07-29 01:00:03,426 INFO L280 TraceCheckUtils]: 2: Hoare triple {1162#true} assume true; {1162#true} is VALID [2020-07-29 01:00:03,426 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1162#true} {1162#true} #92#return; {1162#true} is VALID [2020-07-29 01:00:03,426 INFO L263 TraceCheckUtils]: 4: Hoare triple {1162#true} call #t~ret18 := main(); {1162#true} is VALID [2020-07-29 01:00:03,427 INFO L280 TraceCheckUtils]: 5: Hoare triple {1162#true} assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647; {1162#true} is VALID [2020-07-29 01:00:03,427 INFO L263 TraceCheckUtils]: 6: Hoare triple {1162#true} call #t~ret17 := test_fun(#t~nondet14, #t~nondet15, #t~nondet16); {1162#true} is VALID [2020-07-29 01:00:03,429 INFO L280 TraceCheckUtils]: 7: Hoare triple {1162#true} ~x := #in~x;~y := #in~y;~z := #in~z;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnStack(4);~x_ref~0.base, ~x_ref~0.offset := #t~malloc2.base, #t~malloc2.offset;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnStack(4);~y_ref~0.base, ~y_ref~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~malloc4.base, #t~malloc4.offset := #Ultimate.allocOnStack(4);~z_ref~0.base, ~z_ref~0.offset := #t~malloc4.base, #t~malloc4.offset;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnStack(4);~c~0.base, ~c~0.offset := #t~malloc5.base, #t~malloc5.offset; {1167#(and (= 0 test_fun_~z_ref~0.offset) (= 4 (select |#length| test_fun_~z_ref~0.base)))} is VALID [2020-07-29 01:00:03,434 INFO L280 TraceCheckUtils]: 8: Hoare triple {1167#(and (= 0 test_fun_~z_ref~0.offset) (= 4 (select |#length| test_fun_~z_ref~0.base)))} SUMMARY for call write~int(~x, ~x_ref~0.base, ~x_ref~0.offset, 4); srcloc: L518 {1167#(and (= 0 test_fun_~z_ref~0.offset) (= 4 (select |#length| test_fun_~z_ref~0.base)))} is VALID [2020-07-29 01:00:03,435 INFO L280 TraceCheckUtils]: 9: Hoare triple {1167#(and (= 0 test_fun_~z_ref~0.offset) (= 4 (select |#length| test_fun_~z_ref~0.base)))} SUMMARY for call write~int(~y, ~y_ref~0.base, ~y_ref~0.offset, 4); srcloc: L518-1 {1167#(and (= 0 test_fun_~z_ref~0.offset) (= 4 (select |#length| test_fun_~z_ref~0.base)))} is VALID [2020-07-29 01:00:03,436 INFO L280 TraceCheckUtils]: 10: Hoare triple {1167#(and (= 0 test_fun_~z_ref~0.offset) (= 4 (select |#length| test_fun_~z_ref~0.base)))} assume !(4 + ~z_ref~0.offset <= #length[~z_ref~0.base] && 0 <= ~z_ref~0.offset); {1163#false} is VALID [2020-07-29 01:00:03,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:00:03,437 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448835783] [2020-07-29 01:00:03,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:00:03,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:00:03,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320439849] [2020-07-29 01:00:03,438 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-07-29 01:00:03,439 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:00:03,439 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:00:03,452 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:03,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:00:03,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:00:03,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:00:03,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:00:03,454 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 4 states. [2020-07-29 01:00:03,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:03,702 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2020-07-29 01:00:03,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:00:03,703 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-07-29 01:00:03,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:00:03,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:00:03,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2020-07-29 01:00:03,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:00:03,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2020-07-29 01:00:03,709 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 47 transitions. [2020-07-29 01:00:03,777 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:03,778 INFO L225 Difference]: With dead ends: 42 [2020-07-29 01:00:03,779 INFO L226 Difference]: Without dead ends: 42 [2020-07-29 01:00:03,779 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:00:03,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-29 01:00:03,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-07-29 01:00:03,782 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:00:03,782 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 42 states. [2020-07-29 01:00:03,782 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2020-07-29 01:00:03,783 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2020-07-29 01:00:03,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:03,785 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2020-07-29 01:00:03,785 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2020-07-29 01:00:03,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:03,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:03,785 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2020-07-29 01:00:03,785 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2020-07-29 01:00:03,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:03,787 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2020-07-29 01:00:03,788 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2020-07-29 01:00:03,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:03,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:03,788 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:00:03,788 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:00:03,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-29 01:00:03,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2020-07-29 01:00:03,790 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 11 [2020-07-29 01:00:03,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:00:03,790 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2020-07-29 01:00:03,791 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:00:03,791 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2020-07-29 01:00:03,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-29 01:00:03,791 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:00:03,791 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:00:03,791 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-29 01:00:03,792 INFO L427 AbstractCegarLoop]: === Iteration 7 === [test_funErr25REQUIRES_VIOLATION, test_funErr4REQUIRES_VIOLATION, test_funErr2REQUIRES_VIOLATION, test_funErr3REQUIRES_VIOLATION, test_funErr24REQUIRES_VIOLATION, test_funErr6REQUIRES_VIOLATION, test_funErr7REQUIRES_VIOLATION, test_funErr28REQUIRES_VIOLATION, test_funErr5REQUIRES_VIOLATION, test_funErr26REQUIRES_VIOLATION, test_funErr27REQUIRES_VIOLATION, test_funErr20REQUIRES_VIOLATION, test_funErr18REQUIRES_VIOLATION, test_funErr19REQUIRES_VIOLATION, test_funErr1REQUIRES_VIOLATION, test_funErr22REQUIRES_VIOLATION, test_funErr23REQUIRES_VIOLATION, test_funErr21REQUIRES_VIOLATION, test_funErr0REQUIRES_VIOLATION, test_funErr14REQUIRES_VIOLATION, test_funErr15REQUIRES_VIOLATION, test_funErr13REQUIRES_VIOLATION, test_funErr17REQUIRES_VIOLATION, test_funErr16REQUIRES_VIOLATION, test_funErr9REQUIRES_VIOLATION, test_funErr29REQUIRES_VIOLATION, test_funErr8REQUIRES_VIOLATION, test_funErr12REQUIRES_VIOLATION, test_funErr10REQUIRES_VIOLATION, test_funErr11REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-07-29 01:00:03,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:00:03,792 INFO L82 PathProgramCache]: Analyzing trace with hash 460685931, now seen corresponding path program 1 times [2020-07-29 01:00:03,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:00:03,793 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497756522] [2020-07-29 01:00:03,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:00:03,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:03,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:00:03,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:03,859 INFO L280 TraceCheckUtils]: 0: Hoare triple {1345#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1339#true} is VALID [2020-07-29 01:00:03,859 INFO L280 TraceCheckUtils]: 1: Hoare triple {1339#true} assume true; {1339#true} is VALID [2020-07-29 01:00:03,860 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1339#true} {1339#true} #92#return; {1339#true} is VALID [2020-07-29 01:00:03,862 INFO L263 TraceCheckUtils]: 0: Hoare triple {1339#true} call ULTIMATE.init(); {1345#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:00:03,862 INFO L280 TraceCheckUtils]: 1: Hoare triple {1345#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1339#true} is VALID [2020-07-29 01:00:03,863 INFO L280 TraceCheckUtils]: 2: Hoare triple {1339#true} assume true; {1339#true} is VALID [2020-07-29 01:00:03,863 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1339#true} {1339#true} #92#return; {1339#true} is VALID [2020-07-29 01:00:03,863 INFO L263 TraceCheckUtils]: 4: Hoare triple {1339#true} call #t~ret18 := main(); {1339#true} is VALID [2020-07-29 01:00:03,863 INFO L280 TraceCheckUtils]: 5: Hoare triple {1339#true} assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647; {1339#true} is VALID [2020-07-29 01:00:03,863 INFO L263 TraceCheckUtils]: 6: Hoare triple {1339#true} call #t~ret17 := test_fun(#t~nondet14, #t~nondet15, #t~nondet16); {1339#true} is VALID [2020-07-29 01:00:03,866 INFO L280 TraceCheckUtils]: 7: Hoare triple {1339#true} ~x := #in~x;~y := #in~y;~z := #in~z;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnStack(4);~x_ref~0.base, ~x_ref~0.offset := #t~malloc2.base, #t~malloc2.offset;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnStack(4);~y_ref~0.base, ~y_ref~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~malloc4.base, #t~malloc4.offset := #Ultimate.allocOnStack(4);~z_ref~0.base, ~z_ref~0.offset := #t~malloc4.base, #t~malloc4.offset;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnStack(4);~c~0.base, ~c~0.offset := #t~malloc5.base, #t~malloc5.offset; {1344#(= 1 (select |#valid| test_fun_~c~0.base))} is VALID [2020-07-29 01:00:03,867 INFO L280 TraceCheckUtils]: 8: Hoare triple {1344#(= 1 (select |#valid| test_fun_~c~0.base))} SUMMARY for call write~int(~x, ~x_ref~0.base, ~x_ref~0.offset, 4); srcloc: L518 {1344#(= 1 (select |#valid| test_fun_~c~0.base))} is VALID [2020-07-29 01:00:03,868 INFO L280 TraceCheckUtils]: 9: Hoare triple {1344#(= 1 (select |#valid| test_fun_~c~0.base))} SUMMARY for call write~int(~y, ~y_ref~0.base, ~y_ref~0.offset, 4); srcloc: L518-1 {1344#(= 1 (select |#valid| test_fun_~c~0.base))} is VALID [2020-07-29 01:00:03,869 INFO L280 TraceCheckUtils]: 10: Hoare triple {1344#(= 1 (select |#valid| test_fun_~c~0.base))} SUMMARY for call write~int(~z, ~z_ref~0.base, ~z_ref~0.offset, 4); srcloc: L519 {1344#(= 1 (select |#valid| test_fun_~c~0.base))} is VALID [2020-07-29 01:00:03,871 INFO L280 TraceCheckUtils]: 11: Hoare triple {1344#(= 1 (select |#valid| test_fun_~c~0.base))} assume !(1 == #valid[~c~0.base]); {1340#false} is VALID [2020-07-29 01:00:03,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:00:03,871 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497756522] [2020-07-29 01:00:03,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:00:03,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:00:03,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381548476] [2020-07-29 01:00:03,873 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-07-29 01:00:03,873 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:00:03,873 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:00:03,887 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:03,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:00:03,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:00:03,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:00:03,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:00:03,888 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 4 states. [2020-07-29 01:00:04,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:04,074 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2020-07-29 01:00:04,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:00:04,075 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-07-29 01:00:04,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:00:04,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:00:04,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2020-07-29 01:00:04,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:00:04,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2020-07-29 01:00:04,083 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 43 transitions. [2020-07-29 01:00:04,140 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:04,141 INFO L225 Difference]: With dead ends: 38 [2020-07-29 01:00:04,141 INFO L226 Difference]: Without dead ends: 38 [2020-07-29 01:00:04,141 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:00:04,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-29 01:00:04,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-07-29 01:00:04,148 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:00:04,149 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 38 states. [2020-07-29 01:00:04,149 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2020-07-29 01:00:04,149 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2020-07-29 01:00:04,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:04,151 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2020-07-29 01:00:04,151 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2020-07-29 01:00:04,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:04,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:04,152 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2020-07-29 01:00:04,152 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2020-07-29 01:00:04,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:04,154 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2020-07-29 01:00:04,155 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2020-07-29 01:00:04,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:04,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:04,155 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:00:04,156 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:00:04,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-29 01:00:04,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2020-07-29 01:00:04,159 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 12 [2020-07-29 01:00:04,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:00:04,159 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2020-07-29 01:00:04,160 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:00:04,160 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2020-07-29 01:00:04,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-29 01:00:04,160 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:00:04,161 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:00:04,161 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-29 01:00:04,161 INFO L427 AbstractCegarLoop]: === Iteration 8 === [test_funErr25REQUIRES_VIOLATION, test_funErr4REQUIRES_VIOLATION, test_funErr2REQUIRES_VIOLATION, test_funErr3REQUIRES_VIOLATION, test_funErr24REQUIRES_VIOLATION, test_funErr6REQUIRES_VIOLATION, test_funErr7REQUIRES_VIOLATION, test_funErr28REQUIRES_VIOLATION, test_funErr5REQUIRES_VIOLATION, test_funErr26REQUIRES_VIOLATION, test_funErr27REQUIRES_VIOLATION, test_funErr20REQUIRES_VIOLATION, test_funErr18REQUIRES_VIOLATION, test_funErr19REQUIRES_VIOLATION, test_funErr1REQUIRES_VIOLATION, test_funErr22REQUIRES_VIOLATION, test_funErr23REQUIRES_VIOLATION, test_funErr21REQUIRES_VIOLATION, test_funErr0REQUIRES_VIOLATION, test_funErr14REQUIRES_VIOLATION, test_funErr15REQUIRES_VIOLATION, test_funErr13REQUIRES_VIOLATION, test_funErr17REQUIRES_VIOLATION, test_funErr16REQUIRES_VIOLATION, test_funErr9REQUIRES_VIOLATION, test_funErr29REQUIRES_VIOLATION, test_funErr8REQUIRES_VIOLATION, test_funErr12REQUIRES_VIOLATION, test_funErr10REQUIRES_VIOLATION, test_funErr11REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-07-29 01:00:04,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:00:04,162 INFO L82 PathProgramCache]: Analyzing trace with hash 460685932, now seen corresponding path program 1 times [2020-07-29 01:00:04,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:00:04,163 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269440652] [2020-07-29 01:00:04,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:00:04,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:04,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:00:04,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:04,239 INFO L280 TraceCheckUtils]: 0: Hoare triple {1506#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1500#true} is VALID [2020-07-29 01:00:04,239 INFO L280 TraceCheckUtils]: 1: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-29 01:00:04,239 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1500#true} {1500#true} #92#return; {1500#true} is VALID [2020-07-29 01:00:04,241 INFO L263 TraceCheckUtils]: 0: Hoare triple {1500#true} call ULTIMATE.init(); {1506#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:00:04,242 INFO L280 TraceCheckUtils]: 1: Hoare triple {1506#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1500#true} is VALID [2020-07-29 01:00:04,242 INFO L280 TraceCheckUtils]: 2: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-29 01:00:04,242 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1500#true} {1500#true} #92#return; {1500#true} is VALID [2020-07-29 01:00:04,243 INFO L263 TraceCheckUtils]: 4: Hoare triple {1500#true} call #t~ret18 := main(); {1500#true} is VALID [2020-07-29 01:00:04,243 INFO L280 TraceCheckUtils]: 5: Hoare triple {1500#true} assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647; {1500#true} is VALID [2020-07-29 01:00:04,243 INFO L263 TraceCheckUtils]: 6: Hoare triple {1500#true} call #t~ret17 := test_fun(#t~nondet14, #t~nondet15, #t~nondet16); {1500#true} is VALID [2020-07-29 01:00:04,247 INFO L280 TraceCheckUtils]: 7: Hoare triple {1500#true} ~x := #in~x;~y := #in~y;~z := #in~z;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnStack(4);~x_ref~0.base, ~x_ref~0.offset := #t~malloc2.base, #t~malloc2.offset;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnStack(4);~y_ref~0.base, ~y_ref~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~malloc4.base, #t~malloc4.offset := #Ultimate.allocOnStack(4);~z_ref~0.base, ~z_ref~0.offset := #t~malloc4.base, #t~malloc4.offset;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnStack(4);~c~0.base, ~c~0.offset := #t~malloc5.base, #t~malloc5.offset; {1505#(and (= 4 (select |#length| test_fun_~c~0.base)) (= test_fun_~c~0.offset 0))} is VALID [2020-07-29 01:00:04,248 INFO L280 TraceCheckUtils]: 8: Hoare triple {1505#(and (= 4 (select |#length| test_fun_~c~0.base)) (= test_fun_~c~0.offset 0))} SUMMARY for call write~int(~x, ~x_ref~0.base, ~x_ref~0.offset, 4); srcloc: L518 {1505#(and (= 4 (select |#length| test_fun_~c~0.base)) (= test_fun_~c~0.offset 0))} is VALID [2020-07-29 01:00:04,249 INFO L280 TraceCheckUtils]: 9: Hoare triple {1505#(and (= 4 (select |#length| test_fun_~c~0.base)) (= test_fun_~c~0.offset 0))} SUMMARY for call write~int(~y, ~y_ref~0.base, ~y_ref~0.offset, 4); srcloc: L518-1 {1505#(and (= 4 (select |#length| test_fun_~c~0.base)) (= test_fun_~c~0.offset 0))} is VALID [2020-07-29 01:00:04,250 INFO L280 TraceCheckUtils]: 10: Hoare triple {1505#(and (= 4 (select |#length| test_fun_~c~0.base)) (= test_fun_~c~0.offset 0))} SUMMARY for call write~int(~z, ~z_ref~0.base, ~z_ref~0.offset, 4); srcloc: L519 {1505#(and (= 4 (select |#length| test_fun_~c~0.base)) (= test_fun_~c~0.offset 0))} is VALID [2020-07-29 01:00:04,250 INFO L280 TraceCheckUtils]: 11: Hoare triple {1505#(and (= 4 (select |#length| test_fun_~c~0.base)) (= test_fun_~c~0.offset 0))} assume !(4 + ~c~0.offset <= #length[~c~0.base] && 0 <= ~c~0.offset); {1501#false} is VALID [2020-07-29 01:00:04,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:00:04,251 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269440652] [2020-07-29 01:00:04,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:00:04,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:00:04,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448570864] [2020-07-29 01:00:04,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-07-29 01:00:04,252 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:00:04,252 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:00:04,272 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:04,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:00:04,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:00:04,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:00:04,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:00:04,274 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 4 states. [2020-07-29 01:00:04,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:04,476 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2020-07-29 01:00:04,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:00:04,477 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-07-29 01:00:04,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:00:04,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:00:04,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2020-07-29 01:00:04,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:00:04,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2020-07-29 01:00:04,482 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 39 transitions. [2020-07-29 01:00:04,534 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:04,535 INFO L225 Difference]: With dead ends: 34 [2020-07-29 01:00:04,535 INFO L226 Difference]: Without dead ends: 34 [2020-07-29 01:00:04,536 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:00:04,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-29 01:00:04,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-07-29 01:00:04,540 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:00:04,540 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 34 states. [2020-07-29 01:00:04,540 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2020-07-29 01:00:04,540 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2020-07-29 01:00:04,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:04,542 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2020-07-29 01:00:04,542 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2020-07-29 01:00:04,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:04,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:04,543 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2020-07-29 01:00:04,543 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2020-07-29 01:00:04,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:04,545 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2020-07-29 01:00:04,546 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2020-07-29 01:00:04,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:04,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:04,546 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:00:04,546 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:00:04,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-29 01:00:04,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2020-07-29 01:00:04,548 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 12 [2020-07-29 01:00:04,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:00:04,548 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2020-07-29 01:00:04,548 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:00:04,548 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2020-07-29 01:00:04,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-29 01:00:04,550 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:00:04,551 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:00:04,551 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-29 01:00:04,551 INFO L427 AbstractCegarLoop]: === Iteration 9 === [test_funErr25REQUIRES_VIOLATION, test_funErr4REQUIRES_VIOLATION, test_funErr2REQUIRES_VIOLATION, test_funErr3REQUIRES_VIOLATION, test_funErr24REQUIRES_VIOLATION, test_funErr6REQUIRES_VIOLATION, test_funErr7REQUIRES_VIOLATION, test_funErr28REQUIRES_VIOLATION, test_funErr5REQUIRES_VIOLATION, test_funErr26REQUIRES_VIOLATION, test_funErr27REQUIRES_VIOLATION, test_funErr20REQUIRES_VIOLATION, test_funErr18REQUIRES_VIOLATION, test_funErr19REQUIRES_VIOLATION, test_funErr1REQUIRES_VIOLATION, test_funErr22REQUIRES_VIOLATION, test_funErr23REQUIRES_VIOLATION, test_funErr21REQUIRES_VIOLATION, test_funErr0REQUIRES_VIOLATION, test_funErr14REQUIRES_VIOLATION, test_funErr15REQUIRES_VIOLATION, test_funErr13REQUIRES_VIOLATION, test_funErr17REQUIRES_VIOLATION, test_funErr16REQUIRES_VIOLATION, test_funErr9REQUIRES_VIOLATION, test_funErr29REQUIRES_VIOLATION, test_funErr8REQUIRES_VIOLATION, test_funErr12REQUIRES_VIOLATION, test_funErr10REQUIRES_VIOLATION, test_funErr11REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-07-29 01:00:04,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:00:04,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1533919015, now seen corresponding path program 1 times [2020-07-29 01:00:04,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:00:04,553 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574637316] [2020-07-29 01:00:04,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:00:04,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:04,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:00:04,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:04,668 INFO L280 TraceCheckUtils]: 0: Hoare triple {1663#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1645#true} is VALID [2020-07-29 01:00:04,668 INFO L280 TraceCheckUtils]: 1: Hoare triple {1645#true} assume true; {1645#true} is VALID [2020-07-29 01:00:04,669 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1645#true} {1645#true} #92#return; {1645#true} is VALID [2020-07-29 01:00:04,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-07-29 01:00:04,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:04,833 INFO L280 TraceCheckUtils]: 0: Hoare triple {1664#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y;~z := #in~z;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnStack(4);~x_ref~0.base, ~x_ref~0.offset := #t~malloc2.base, #t~malloc2.offset;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnStack(4);~y_ref~0.base, ~y_ref~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~malloc4.base, #t~malloc4.offset := #Ultimate.allocOnStack(4);~z_ref~0.base, ~z_ref~0.offset := #t~malloc4.base, #t~malloc4.offset;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnStack(4);~c~0.base, ~c~0.offset := #t~malloc5.base, #t~malloc5.offset; {1665#(and (= (store (store (store (store |#valid| |test_fun_#t~malloc2.base| 0) |test_fun_#t~malloc4.base| 0) |test_fun_#t~malloc3.base| 0) |test_fun_#t~malloc5.base| 0) |old(#valid)|) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc4.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc3.base|)))} is VALID [2020-07-29 01:00:04,835 INFO L280 TraceCheckUtils]: 1: Hoare triple {1665#(and (= (store (store (store (store |#valid| |test_fun_#t~malloc2.base| 0) |test_fun_#t~malloc4.base| 0) |test_fun_#t~malloc3.base| 0) |test_fun_#t~malloc5.base| 0) |old(#valid)|) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc4.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc3.base|)))} SUMMARY for call write~int(~x, ~x_ref~0.base, ~x_ref~0.offset, 4); srcloc: L518 {1665#(and (= (store (store (store (store |#valid| |test_fun_#t~malloc2.base| 0) |test_fun_#t~malloc4.base| 0) |test_fun_#t~malloc3.base| 0) |test_fun_#t~malloc5.base| 0) |old(#valid)|) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc4.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc3.base|)))} is VALID [2020-07-29 01:00:04,836 INFO L280 TraceCheckUtils]: 2: Hoare triple {1665#(and (= (store (store (store (store |#valid| |test_fun_#t~malloc2.base| 0) |test_fun_#t~malloc4.base| 0) |test_fun_#t~malloc3.base| 0) |test_fun_#t~malloc5.base| 0) |old(#valid)|) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc4.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc3.base|)))} SUMMARY for call write~int(~y, ~y_ref~0.base, ~y_ref~0.offset, 4); srcloc: L518-1 {1665#(and (= (store (store (store (store |#valid| |test_fun_#t~malloc2.base| 0) |test_fun_#t~malloc4.base| 0) |test_fun_#t~malloc3.base| 0) |test_fun_#t~malloc5.base| 0) |old(#valid)|) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc4.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc3.base|)))} is VALID [2020-07-29 01:00:04,838 INFO L280 TraceCheckUtils]: 3: Hoare triple {1665#(and (= (store (store (store (store |#valid| |test_fun_#t~malloc2.base| 0) |test_fun_#t~malloc4.base| 0) |test_fun_#t~malloc3.base| 0) |test_fun_#t~malloc5.base| 0) |old(#valid)|) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc4.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc3.base|)))} SUMMARY for call write~int(~z, ~z_ref~0.base, ~z_ref~0.offset, 4); srcloc: L519 {1665#(and (= (store (store (store (store |#valid| |test_fun_#t~malloc2.base| 0) |test_fun_#t~malloc4.base| 0) |test_fun_#t~malloc3.base| 0) |test_fun_#t~malloc5.base| 0) |old(#valid)|) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc4.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc3.base|)))} is VALID [2020-07-29 01:00:04,840 INFO L280 TraceCheckUtils]: 4: Hoare triple {1665#(and (= (store (store (store (store |#valid| |test_fun_#t~malloc2.base| 0) |test_fun_#t~malloc4.base| 0) |test_fun_#t~malloc3.base| 0) |test_fun_#t~malloc5.base| 0) |old(#valid)|) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc4.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc3.base|)))} SUMMARY for call write~int(0, ~c~0.base, ~c~0.offset, 4); srcloc: L520 {1665#(and (= (store (store (store (store |#valid| |test_fun_#t~malloc2.base| 0) |test_fun_#t~malloc4.base| 0) |test_fun_#t~malloc3.base| 0) |test_fun_#t~malloc5.base| 0) |old(#valid)|) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc4.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc3.base|)))} is VALID [2020-07-29 01:00:04,841 INFO L280 TraceCheckUtils]: 5: Hoare triple {1665#(and (= (store (store (store (store |#valid| |test_fun_#t~malloc2.base| 0) |test_fun_#t~malloc4.base| 0) |test_fun_#t~malloc3.base| 0) |test_fun_#t~malloc5.base| 0) |old(#valid)|) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc4.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc3.base|)))} SUMMARY for call #t~mem6 := read~int(~x_ref~0.base, ~x_ref~0.offset, 4); srcloc: L522-3 {1665#(and (= (store (store (store (store |#valid| |test_fun_#t~malloc2.base| 0) |test_fun_#t~malloc4.base| 0) |test_fun_#t~malloc3.base| 0) |test_fun_#t~malloc5.base| 0) |old(#valid)|) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc4.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc3.base|)))} is VALID [2020-07-29 01:00:04,843 INFO L280 TraceCheckUtils]: 6: Hoare triple {1665#(and (= (store (store (store (store |#valid| |test_fun_#t~malloc2.base| 0) |test_fun_#t~malloc4.base| 0) |test_fun_#t~malloc3.base| 0) |test_fun_#t~malloc5.base| 0) |old(#valid)|) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc4.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc3.base|)))} SUMMARY for call #t~mem7 := read~int(~y_ref~0.base, ~y_ref~0.offset, 4); srcloc: L522 {1665#(and (= (store (store (store (store |#valid| |test_fun_#t~malloc2.base| 0) |test_fun_#t~malloc4.base| 0) |test_fun_#t~malloc3.base| 0) |test_fun_#t~malloc5.base| 0) |old(#valid)|) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc4.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc3.base|)))} is VALID [2020-07-29 01:00:04,844 INFO L280 TraceCheckUtils]: 7: Hoare triple {1665#(and (= (store (store (store (store |#valid| |test_fun_#t~malloc2.base| 0) |test_fun_#t~malloc4.base| 0) |test_fun_#t~malloc3.base| 0) |test_fun_#t~malloc5.base| 0) |old(#valid)|) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc4.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc3.base|)))} assume !(#t~mem6 < #t~mem7);havoc #t~mem6;havoc #t~mem7; {1665#(and (= (store (store (store (store |#valid| |test_fun_#t~malloc2.base| 0) |test_fun_#t~malloc4.base| 0) |test_fun_#t~malloc3.base| 0) |test_fun_#t~malloc5.base| 0) |old(#valid)|) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc4.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc3.base|)))} is VALID [2020-07-29 01:00:04,846 INFO L280 TraceCheckUtils]: 8: Hoare triple {1665#(and (= (store (store (store (store |#valid| |test_fun_#t~malloc2.base| 0) |test_fun_#t~malloc4.base| 0) |test_fun_#t~malloc3.base| 0) |test_fun_#t~malloc5.base| 0) |old(#valid)|) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc4.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc3.base|)))} SUMMARY for call #t~mem13 := read~int(~c~0.base, ~c~0.offset, 4); srcloc: L522-4 {1665#(and (= (store (store (store (store |#valid| |test_fun_#t~malloc2.base| 0) |test_fun_#t~malloc4.base| 0) |test_fun_#t~malloc3.base| 0) |test_fun_#t~malloc5.base| 0) |old(#valid)|) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc4.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc3.base|)))} is VALID [2020-07-29 01:00:04,848 INFO L280 TraceCheckUtils]: 9: Hoare triple {1665#(and (= (store (store (store (store |#valid| |test_fun_#t~malloc2.base| 0) |test_fun_#t~malloc4.base| 0) |test_fun_#t~malloc3.base| 0) |test_fun_#t~malloc5.base| 0) |old(#valid)|) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc4.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc3.base|)))} #res := #t~mem13;havoc #t~mem13;call ULTIMATE.dealloc(#t~malloc2.base, #t~malloc2.offset);havoc #t~malloc2.base, #t~malloc2.offset;call ULTIMATE.dealloc(#t~malloc3.base, #t~malloc3.offset);havoc #t~malloc3.base, #t~malloc3.offset;call ULTIMATE.dealloc(#t~malloc4.base, #t~malloc4.offset);havoc #t~malloc4.base, #t~malloc4.offset;call ULTIMATE.dealloc(#t~malloc5.base, #t~malloc5.offset);havoc #t~malloc5.base, #t~malloc5.offset; {1650#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:00:04,849 INFO L280 TraceCheckUtils]: 10: Hoare triple {1650#(= |#valid| |old(#valid)|)} assume true; {1650#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:00:04,851 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {1650#(= |#valid| |old(#valid)|)} {1650#(= |#valid| |old(#valid)|)} #90#return; {1650#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:00:04,854 INFO L263 TraceCheckUtils]: 0: Hoare triple {1645#true} call ULTIMATE.init(); {1663#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:00:04,854 INFO L280 TraceCheckUtils]: 1: Hoare triple {1663#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1645#true} is VALID [2020-07-29 01:00:04,855 INFO L280 TraceCheckUtils]: 2: Hoare triple {1645#true} assume true; {1645#true} is VALID [2020-07-29 01:00:04,855 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1645#true} {1645#true} #92#return; {1645#true} is VALID [2020-07-29 01:00:04,856 INFO L263 TraceCheckUtils]: 4: Hoare triple {1645#true} call #t~ret18 := main(); {1650#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:00:04,857 INFO L280 TraceCheckUtils]: 5: Hoare triple {1650#(= |#valid| |old(#valid)|)} assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647; {1650#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:00:04,859 INFO L263 TraceCheckUtils]: 6: Hoare triple {1650#(= |#valid| |old(#valid)|)} call #t~ret17 := test_fun(#t~nondet14, #t~nondet15, #t~nondet16); {1664#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-29 01:00:04,863 INFO L280 TraceCheckUtils]: 7: Hoare triple {1664#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y;~z := #in~z;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnStack(4);~x_ref~0.base, ~x_ref~0.offset := #t~malloc2.base, #t~malloc2.offset;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnStack(4);~y_ref~0.base, ~y_ref~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~malloc4.base, #t~malloc4.offset := #Ultimate.allocOnStack(4);~z_ref~0.base, ~z_ref~0.offset := #t~malloc4.base, #t~malloc4.offset;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnStack(4);~c~0.base, ~c~0.offset := #t~malloc5.base, #t~malloc5.offset; {1665#(and (= (store (store (store (store |#valid| |test_fun_#t~malloc2.base| 0) |test_fun_#t~malloc4.base| 0) |test_fun_#t~malloc3.base| 0) |test_fun_#t~malloc5.base| 0) |old(#valid)|) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc4.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc3.base|)))} is VALID [2020-07-29 01:00:04,865 INFO L280 TraceCheckUtils]: 8: Hoare triple {1665#(and (= (store (store (store (store |#valid| |test_fun_#t~malloc2.base| 0) |test_fun_#t~malloc4.base| 0) |test_fun_#t~malloc3.base| 0) |test_fun_#t~malloc5.base| 0) |old(#valid)|) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc4.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc3.base|)))} SUMMARY for call write~int(~x, ~x_ref~0.base, ~x_ref~0.offset, 4); srcloc: L518 {1665#(and (= (store (store (store (store |#valid| |test_fun_#t~malloc2.base| 0) |test_fun_#t~malloc4.base| 0) |test_fun_#t~malloc3.base| 0) |test_fun_#t~malloc5.base| 0) |old(#valid)|) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc4.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc3.base|)))} is VALID [2020-07-29 01:00:04,867 INFO L280 TraceCheckUtils]: 9: Hoare triple {1665#(and (= (store (store (store (store |#valid| |test_fun_#t~malloc2.base| 0) |test_fun_#t~malloc4.base| 0) |test_fun_#t~malloc3.base| 0) |test_fun_#t~malloc5.base| 0) |old(#valid)|) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc4.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc3.base|)))} SUMMARY for call write~int(~y, ~y_ref~0.base, ~y_ref~0.offset, 4); srcloc: L518-1 {1665#(and (= (store (store (store (store |#valid| |test_fun_#t~malloc2.base| 0) |test_fun_#t~malloc4.base| 0) |test_fun_#t~malloc3.base| 0) |test_fun_#t~malloc5.base| 0) |old(#valid)|) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc4.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc3.base|)))} is VALID [2020-07-29 01:00:04,868 INFO L280 TraceCheckUtils]: 10: Hoare triple {1665#(and (= (store (store (store (store |#valid| |test_fun_#t~malloc2.base| 0) |test_fun_#t~malloc4.base| 0) |test_fun_#t~malloc3.base| 0) |test_fun_#t~malloc5.base| 0) |old(#valid)|) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc4.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc3.base|)))} SUMMARY for call write~int(~z, ~z_ref~0.base, ~z_ref~0.offset, 4); srcloc: L519 {1665#(and (= (store (store (store (store |#valid| |test_fun_#t~malloc2.base| 0) |test_fun_#t~malloc4.base| 0) |test_fun_#t~malloc3.base| 0) |test_fun_#t~malloc5.base| 0) |old(#valid)|) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc4.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc3.base|)))} is VALID [2020-07-29 01:00:04,870 INFO L280 TraceCheckUtils]: 11: Hoare triple {1665#(and (= (store (store (store (store |#valid| |test_fun_#t~malloc2.base| 0) |test_fun_#t~malloc4.base| 0) |test_fun_#t~malloc3.base| 0) |test_fun_#t~malloc5.base| 0) |old(#valid)|) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc4.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc3.base|)))} SUMMARY for call write~int(0, ~c~0.base, ~c~0.offset, 4); srcloc: L520 {1665#(and (= (store (store (store (store |#valid| |test_fun_#t~malloc2.base| 0) |test_fun_#t~malloc4.base| 0) |test_fun_#t~malloc3.base| 0) |test_fun_#t~malloc5.base| 0) |old(#valid)|) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc4.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc3.base|)))} is VALID [2020-07-29 01:00:04,872 INFO L280 TraceCheckUtils]: 12: Hoare triple {1665#(and (= (store (store (store (store |#valid| |test_fun_#t~malloc2.base| 0) |test_fun_#t~malloc4.base| 0) |test_fun_#t~malloc3.base| 0) |test_fun_#t~malloc5.base| 0) |old(#valid)|) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc4.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc3.base|)))} SUMMARY for call #t~mem6 := read~int(~x_ref~0.base, ~x_ref~0.offset, 4); srcloc: L522-3 {1665#(and (= (store (store (store (store |#valid| |test_fun_#t~malloc2.base| 0) |test_fun_#t~malloc4.base| 0) |test_fun_#t~malloc3.base| 0) |test_fun_#t~malloc5.base| 0) |old(#valid)|) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc4.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc3.base|)))} is VALID [2020-07-29 01:00:04,873 INFO L280 TraceCheckUtils]: 13: Hoare triple {1665#(and (= (store (store (store (store |#valid| |test_fun_#t~malloc2.base| 0) |test_fun_#t~malloc4.base| 0) |test_fun_#t~malloc3.base| 0) |test_fun_#t~malloc5.base| 0) |old(#valid)|) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc4.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc3.base|)))} SUMMARY for call #t~mem7 := read~int(~y_ref~0.base, ~y_ref~0.offset, 4); srcloc: L522 {1665#(and (= (store (store (store (store |#valid| |test_fun_#t~malloc2.base| 0) |test_fun_#t~malloc4.base| 0) |test_fun_#t~malloc3.base| 0) |test_fun_#t~malloc5.base| 0) |old(#valid)|) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc4.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc3.base|)))} is VALID [2020-07-29 01:00:04,875 INFO L280 TraceCheckUtils]: 14: Hoare triple {1665#(and (= (store (store (store (store |#valid| |test_fun_#t~malloc2.base| 0) |test_fun_#t~malloc4.base| 0) |test_fun_#t~malloc3.base| 0) |test_fun_#t~malloc5.base| 0) |old(#valid)|) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc4.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc3.base|)))} assume !(#t~mem6 < #t~mem7);havoc #t~mem6;havoc #t~mem7; {1665#(and (= (store (store (store (store |#valid| |test_fun_#t~malloc2.base| 0) |test_fun_#t~malloc4.base| 0) |test_fun_#t~malloc3.base| 0) |test_fun_#t~malloc5.base| 0) |old(#valid)|) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc4.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc3.base|)))} is VALID [2020-07-29 01:00:04,877 INFO L280 TraceCheckUtils]: 15: Hoare triple {1665#(and (= (store (store (store (store |#valid| |test_fun_#t~malloc2.base| 0) |test_fun_#t~malloc4.base| 0) |test_fun_#t~malloc3.base| 0) |test_fun_#t~malloc5.base| 0) |old(#valid)|) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc4.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc3.base|)))} SUMMARY for call #t~mem13 := read~int(~c~0.base, ~c~0.offset, 4); srcloc: L522-4 {1665#(and (= (store (store (store (store |#valid| |test_fun_#t~malloc2.base| 0) |test_fun_#t~malloc4.base| 0) |test_fun_#t~malloc3.base| 0) |test_fun_#t~malloc5.base| 0) |old(#valid)|) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc4.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc3.base|)))} is VALID [2020-07-29 01:00:04,878 INFO L280 TraceCheckUtils]: 16: Hoare triple {1665#(and (= (store (store (store (store |#valid| |test_fun_#t~malloc2.base| 0) |test_fun_#t~malloc4.base| 0) |test_fun_#t~malloc3.base| 0) |test_fun_#t~malloc5.base| 0) |old(#valid)|) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc4.base| |test_fun_#t~malloc5.base|)) (not (= |test_fun_#t~malloc3.base| |test_fun_#t~malloc4.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc3.base|)))} #res := #t~mem13;havoc #t~mem13;call ULTIMATE.dealloc(#t~malloc2.base, #t~malloc2.offset);havoc #t~malloc2.base, #t~malloc2.offset;call ULTIMATE.dealloc(#t~malloc3.base, #t~malloc3.offset);havoc #t~malloc3.base, #t~malloc3.offset;call ULTIMATE.dealloc(#t~malloc4.base, #t~malloc4.offset);havoc #t~malloc4.base, #t~malloc4.offset;call ULTIMATE.dealloc(#t~malloc5.base, #t~malloc5.offset);havoc #t~malloc5.base, #t~malloc5.offset; {1650#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:00:04,879 INFO L280 TraceCheckUtils]: 17: Hoare triple {1650#(= |#valid| |old(#valid)|)} assume true; {1650#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:00:04,881 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1650#(= |#valid| |old(#valid)|)} {1650#(= |#valid| |old(#valid)|)} #90#return; {1650#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:00:04,882 INFO L280 TraceCheckUtils]: 19: Hoare triple {1650#(= |#valid| |old(#valid)|)} assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647;#res := #t~ret17;havoc #t~nondet14;havoc #t~nondet15;havoc #t~ret17;havoc #t~nondet16; {1650#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:00:04,883 INFO L280 TraceCheckUtils]: 20: Hoare triple {1650#(= |#valid| |old(#valid)|)} assume !(#valid == old(#valid)); {1646#false} is VALID [2020-07-29 01:00:04,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:00:04,888 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574637316] [2020-07-29 01:00:04,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:00:04,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 01:00:04,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820702082] [2020-07-29 01:00:04,889 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-07-29 01:00:04,889 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:00:04,890 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:00:04,924 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:04,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-29 01:00:04,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:00:04,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:00:04,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:00:04,925 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 6 states. [2020-07-29 01:00:05,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:05,246 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2020-07-29 01:00:05,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:00:05,247 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-07-29 01:00:05,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:00:05,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:00:05,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2020-07-29 01:00:05,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:00:05,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2020-07-29 01:00:05,251 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 35 transitions. [2020-07-29 01:00:05,337 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:05,337 INFO L225 Difference]: With dead ends: 33 [2020-07-29 01:00:05,337 INFO L226 Difference]: Without dead ends: 0 [2020-07-29 01:00:05,338 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:00:05,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-29 01:00:05,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-29 01:00:05,339 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:00:05,339 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-29 01:00:05,339 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-29 01:00:05,339 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-29 01:00:05,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:05,340 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-29 01:00:05,340 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:00:05,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:05,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:05,340 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-29 01:00:05,341 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-29 01:00:05,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:05,341 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-29 01:00:05,341 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:00:05,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:05,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:05,341 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:00:05,342 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:00:05,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-29 01:00:05,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-29 01:00:05,342 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2020-07-29 01:00:05,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:00:05,342 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:00:05,342 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-29 01:00:05,342 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:00:05,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:05,343 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-29 01:00:05,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.07 01:00:05 BoogieIcfgContainer [2020-07-29 01:00:05,347 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-29 01:00:05,348 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:00:05,348 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:00:05,348 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:00:05,349 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 12:59:59" (3/4) ... [2020-07-29 01:00:05,353 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-07-29 01:00:05,359 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2020-07-29 01:00:05,359 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2020-07-29 01:00:05,359 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure test_fun [2020-07-29 01:00:05,360 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2020-07-29 01:00:05,360 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2020-07-29 01:00:05,360 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2020-07-29 01:00:05,360 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2020-07-29 01:00:05,360 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2020-07-29 01:00:05,366 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2020-07-29 01:00:05,367 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2020-07-29 01:00:05,367 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-07-29 01:00:05,367 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-07-29 01:00:05,479 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-29 01:00:05,480 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:00:05,484 INFO L168 Benchmark]: Toolchain (without parser) took 7079.05 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 302.0 MB). Free memory was 961.6 MB in the beginning and 1.3 GB in the end (delta: -322.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:00:05,485 INFO L168 Benchmark]: CDTParser took 0.67 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:00:05,485 INFO L168 Benchmark]: CACSL2BoogieTranslator took 629.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 961.6 MB in the beginning and 1.1 GB in the end (delta: -154.4 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:00:05,487 INFO L168 Benchmark]: Boogie Preprocessor took 65.77 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:00:05,487 INFO L168 Benchmark]: RCFGBuilder took 843.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 70.5 MB). Peak memory consumption was 70.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:00:05,488 INFO L168 Benchmark]: TraceAbstraction took 5400.31 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 162.5 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -257.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:00:05,488 INFO L168 Benchmark]: Witness Printer took 132.37 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 11.5 GB. [2020-07-29 01:00:05,492 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.67 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 629.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 961.6 MB in the beginning and 1.1 GB in the end (delta: -154.4 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 65.77 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 843.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 70.5 MB). Peak memory consumption was 70.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5400.31 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 162.5 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -257.7 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 132.37 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 528]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 520]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 519]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 519]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 528]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 521]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 521]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 530]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 520]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 528]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 528]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 526]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 524]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 524]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 518]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 526]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 526]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 526]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 518]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 523]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 523]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 523]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 524]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 524]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 522]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 530]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 522]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 523]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 522]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 522]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 532]: 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 9 procedures, 82 locations, 31 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 5.3s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 202 SDtfs, 301 SDslu, 93 SDs, 0 SdLazy, 636 SolverSat, 46 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s 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 DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 105 NumberOfCodeBlocks, 105 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 10636 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...