./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/list-properties/simple-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) 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/list-properties/simple-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d0cf6b9a1a7372eb466349e319faa44cf865bdad ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup) --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:19:44,610 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:19:44,613 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:19:44,633 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:19:44,633 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:19:44,635 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:19:44,638 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:19:44,648 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:19:44,653 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:19:44,658 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:19:44,659 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:19:44,661 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:19:44,662 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:19:44,664 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:19:44,666 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:19:44,667 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:19:44,668 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:19:44,669 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:19:44,672 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:19:44,676 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:19:44,681 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:19:44,685 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:19:44,687 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:19:44,687 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:19:44,690 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:19:44,691 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:19:44,691 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:19:44,693 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:19:44,694 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:19:44,695 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:19:44,695 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:19:44,696 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:19:44,697 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:19:44,698 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:19:44,700 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:19:44,700 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:19:44,701 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:19:44,701 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:19:44,701 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:19:44,702 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:19:44,704 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:19:44,705 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2020-07-29 01:19:44,744 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:19:44,744 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:19:44,749 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:19:44,750 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:19:44,750 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:19:44,750 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:19:44,751 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 01:19:44,751 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:19:44,751 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:19:44,751 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 01:19:44,751 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:19:44,751 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-07-29 01:19:44,752 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-07-29 01:19:44,752 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-29 01:19:44,752 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-07-29 01:19:44,753 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 01:19:44,754 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:19:44,754 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:19:44,754 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:19:44,755 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-29 01:19:44,755 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-29 01:19:44,755 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 01:19:44,755 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:19:44,756 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-29 01:19:44,756 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:19:44,757 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-29 01:19:44,757 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:19:44,757 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-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d0cf6b9a1a7372eb466349e319faa44cf865bdad [2020-07-29 01:19:45,081 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:19:45,095 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:19:45,099 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:19:45,101 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:19:45,102 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:19:45,102 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/simple-1.i [2020-07-29 01:19:45,182 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43728e7b0/1a74c48184b64ad0acc8c671f9f06571/FLAG2b8697eca [2020-07-29 01:19:45,700 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:19:45,701 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/simple-1.i [2020-07-29 01:19:45,715 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43728e7b0/1a74c48184b64ad0acc8c671f9f06571/FLAG2b8697eca [2020-07-29 01:19:46,016 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43728e7b0/1a74c48184b64ad0acc8c671f9f06571 [2020-07-29 01:19:46,019 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:19:46,023 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-07-29 01:19:46,024 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:19:46,025 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:19:46,028 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:19:46,030 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:19:46" (1/1) ... [2020-07-29 01:19:46,033 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3aed57f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:19:46, skipping insertion in model container [2020-07-29 01:19:46,033 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:19:46" (1/1) ... [2020-07-29 01:19:46,041 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:19:46,102 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:19:46,632 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:19:46,648 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:19:46,723 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:19:46,795 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:19:46,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:19:46 WrapperNode [2020-07-29 01:19:46,796 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:19:46,797 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:19:46,797 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:19:46,798 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:19:46,812 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:19:46" (1/1) ... [2020-07-29 01:19:46,812 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:19:46" (1/1) ... [2020-07-29 01:19:46,850 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:19:46" (1/1) ... [2020-07-29 01:19:46,850 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:19:46" (1/1) ... [2020-07-29 01:19:46,889 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:19:46" (1/1) ... [2020-07-29 01:19:46,902 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:19:46" (1/1) ... [2020-07-29 01:19:46,911 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:19:46" (1/1) ... [2020-07-29 01:19:46,918 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:19:46,919 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:19:46,919 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:19:46,919 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:19:46,920 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:19:46" (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 01:19:46,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-29 01:19:46,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:19:46,994 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-07-29 01:19:46,994 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-07-29 01:19:46,994 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2020-07-29 01:19:46,994 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2020-07-29 01:19:46,995 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2020-07-29 01:19:46,995 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2020-07-29 01:19:46,995 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-29 01:19:46,995 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-29 01:19:46,996 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-29 01:19:46,996 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-29 01:19:46,996 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-29 01:19:46,996 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-29 01:19:46,997 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-29 01:19:46,997 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-29 01:19:46,997 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-29 01:19:46,997 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-29 01:19:46,998 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-29 01:19:46,998 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-29 01:19:46,998 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-29 01:19:46,999 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-29 01:19:46,999 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-29 01:19:46,999 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-29 01:19:46,999 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-29 01:19:47,000 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-29 01:19:47,000 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-29 01:19:47,000 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-07-29 01:19:47,000 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-07-29 01:19:47,001 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2020-07-29 01:19:47,001 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2020-07-29 01:19:47,001 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2020-07-29 01:19:47,002 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-29 01:19:47,002 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-29 01:19:47,002 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-29 01:19:47,002 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-29 01:19:47,003 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-29 01:19:47,003 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-29 01:19:47,003 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-29 01:19:47,003 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-29 01:19:47,004 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-29 01:19:47,004 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-29 01:19:47,004 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-29 01:19:47,005 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-29 01:19:47,005 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-29 01:19:47,005 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-29 01:19:47,005 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-29 01:19:47,006 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-29 01:19:47,006 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-29 01:19:47,006 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-29 01:19:47,006 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-29 01:19:47,006 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-29 01:19:47,006 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-29 01:19:47,007 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-29 01:19:47,007 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-29 01:19:47,007 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-29 01:19:47,007 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-29 01:19:47,008 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-29 01:19:47,008 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-29 01:19:47,008 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-29 01:19:47,008 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-29 01:19:47,008 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-29 01:19:47,009 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-29 01:19:47,009 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-29 01:19:47,009 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-29 01:19:47,009 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-29 01:19:47,010 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-29 01:19:47,010 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-29 01:19:47,010 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-29 01:19:47,010 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-29 01:19:47,010 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-29 01:19:47,011 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-29 01:19:47,011 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-29 01:19:47,011 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-29 01:19:47,011 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-29 01:19:47,011 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-29 01:19:47,012 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-29 01:19:47,012 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-29 01:19:47,012 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-29 01:19:47,012 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-29 01:19:47,013 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-29 01:19:47,013 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-29 01:19:47,013 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-29 01:19:47,013 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-29 01:19:47,013 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-29 01:19:47,014 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-29 01:19:47,014 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-29 01:19:47,014 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-29 01:19:47,014 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-29 01:19:47,014 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-29 01:19:47,015 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-29 01:19:47,015 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-29 01:19:47,015 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-29 01:19:47,015 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-29 01:19:47,015 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-29 01:19:47,016 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-29 01:19:47,016 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-29 01:19:47,016 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-29 01:19:47,016 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-29 01:19:47,016 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-29 01:19:47,017 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-29 01:19:47,017 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-29 01:19:47,017 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-29 01:19:47,017 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-29 01:19:47,017 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-29 01:19:47,018 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-29 01:19:47,018 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-29 01:19:47,018 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-29 01:19:47,018 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-29 01:19:47,018 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-29 01:19:47,019 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-29 01:19:47,019 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-29 01:19:47,019 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-29 01:19:47,019 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-29 01:19:47,019 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-29 01:19:47,020 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-29 01:19:47,020 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-29 01:19:47,020 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-29 01:19:47,020 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2020-07-29 01:19:47,020 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-29 01:19:47,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-29 01:19:47,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:19:47,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-29 01:19:47,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-29 01:19:47,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:19:47,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-29 01:19:47,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:19:47,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:19:47,317 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2020-07-29 01:19:47,721 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:19:47,722 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-29 01:19:47,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:19:47 BoogieIcfgContainer [2020-07-29 01:19:47,729 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:19:47,734 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-29 01:19:47,735 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-29 01:19:47,739 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-29 01:19:47,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.07 01:19:46" (1/3) ... [2020-07-29 01:19:47,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f2b428c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:19:47, skipping insertion in model container [2020-07-29 01:19:47,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:19:46" (2/3) ... [2020-07-29 01:19:47,742 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f2b428c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:19:47, skipping insertion in model container [2020-07-29 01:19:47,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:19:47" (3/3) ... [2020-07-29 01:19:47,746 INFO L109 eAbstractionObserver]: Analyzing ICFG simple-1.i [2020-07-29 01:19:47,757 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-29 01:19:47,764 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2020-07-29 01:19:47,779 INFO L251 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2020-07-29 01:19:47,798 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-29 01:19:47,799 INFO L376 AbstractCegarLoop]: Hoare is false [2020-07-29 01:19:47,799 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-29 01:19:47,799 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:19:47,800 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:19:47,800 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-29 01:19:47,800 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:19:47,800 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-29 01:19:47,816 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2020-07-29 01:19:47,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-29 01:19:47,826 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:47,828 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:19:47,828 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, mainErr14ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-07-29 01:19:47,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:47,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1889428658, now seen corresponding path program 1 times [2020-07-29 01:19:47,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:47,844 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291442068] [2020-07-29 01:19:47,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:47,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:48,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:48,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:48,063 INFO L280 TraceCheckUtils]: 0: Hoare triple {62#(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; {56#true} is VALID [2020-07-29 01:19:48,064 INFO L280 TraceCheckUtils]: 1: Hoare triple {56#true} assume true; {56#true} is VALID [2020-07-29 01:19:48,064 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {56#true} {56#true} #106#return; {56#true} is VALID [2020-07-29 01:19:48,068 INFO L263 TraceCheckUtils]: 0: Hoare triple {56#true} call ULTIMATE.init(); {62#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:48,068 INFO L280 TraceCheckUtils]: 1: Hoare triple {62#(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; {56#true} is VALID [2020-07-29 01:19:48,069 INFO L280 TraceCheckUtils]: 2: Hoare triple {56#true} assume true; {56#true} is VALID [2020-07-29 01:19:48,069 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {56#true} {56#true} #106#return; {56#true} is VALID [2020-07-29 01:19:48,069 INFO L263 TraceCheckUtils]: 4: Hoare triple {56#true} call #t~ret8 := main(); {56#true} is VALID [2020-07-29 01:19:48,071 INFO L280 TraceCheckUtils]: 5: Hoare triple {56#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {61#(= 1 (select |#valid| main_~a~0.base))} is VALID [2020-07-29 01:19:48,072 INFO L280 TraceCheckUtils]: 6: Hoare triple {61#(= 1 (select |#valid| main_~a~0.base))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {61#(= 1 (select |#valid| main_~a~0.base))} is VALID [2020-07-29 01:19:48,073 INFO L280 TraceCheckUtils]: 7: Hoare triple {61#(= 1 (select |#valid| main_~a~0.base))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {61#(= 1 (select |#valid| main_~a~0.base))} is VALID [2020-07-29 01:19:48,074 INFO L280 TraceCheckUtils]: 8: Hoare triple {61#(= 1 (select |#valid| main_~a~0.base))} assume !(1 == #valid[~a~0.base]); {57#false} is VALID [2020-07-29 01:19:48,076 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:19:48,076 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291442068] [2020-07-29 01:19:48,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:48,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:19:48,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160065349] [2020-07-29 01:19:48,084 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-07-29 01:19:48,087 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:48,091 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:19:48,111 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:19:48,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:19:48,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:48,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:19:48,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:19:48,125 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 4 states. [2020-07-29 01:19:48,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:48,502 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2020-07-29 01:19:48,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:19:48,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-07-29 01:19:48,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:48,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:19:48,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2020-07-29 01:19:48,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:19:48,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2020-07-29 01:19:48,523 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 59 transitions. [2020-07-29 01:19:48,627 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:48,654 INFO L225 Difference]: With dead ends: 52 [2020-07-29 01:19:48,654 INFO L226 Difference]: Without dead ends: 45 [2020-07-29 01:19:48,656 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:19:48,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-07-29 01:19:48,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-07-29 01:19:48,694 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:48,694 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 45 states. [2020-07-29 01:19:48,695 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2020-07-29 01:19:48,695 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2020-07-29 01:19:48,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:48,713 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2020-07-29 01:19:48,713 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2020-07-29 01:19:48,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:48,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:48,714 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2020-07-29 01:19:48,715 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2020-07-29 01:19:48,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:48,724 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2020-07-29 01:19:48,724 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2020-07-29 01:19:48,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:48,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:48,726 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:48,726 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:48,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-29 01:19:48,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2020-07-29 01:19:48,735 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 9 [2020-07-29 01:19:48,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:48,735 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2020-07-29 01:19:48,735 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:19:48,736 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2020-07-29 01:19:48,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-29 01:19:48,737 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:48,737 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:19:48,737 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-29 01:19:48,737 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, mainErr14ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-07-29 01:19:48,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:48,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1889428659, now seen corresponding path program 1 times [2020-07-29 01:19:48,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:48,739 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767815283] [2020-07-29 01:19:48,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:48,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:48,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:48,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:48,832 INFO L280 TraceCheckUtils]: 0: Hoare triple {260#(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; {254#true} is VALID [2020-07-29 01:19:48,833 INFO L280 TraceCheckUtils]: 1: Hoare triple {254#true} assume true; {254#true} is VALID [2020-07-29 01:19:48,833 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {254#true} {254#true} #106#return; {254#true} is VALID [2020-07-29 01:19:48,834 INFO L263 TraceCheckUtils]: 0: Hoare triple {254#true} call ULTIMATE.init(); {260#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:48,835 INFO L280 TraceCheckUtils]: 1: Hoare triple {260#(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; {254#true} is VALID [2020-07-29 01:19:48,835 INFO L280 TraceCheckUtils]: 2: Hoare triple {254#true} assume true; {254#true} is VALID [2020-07-29 01:19:48,835 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {254#true} {254#true} #106#return; {254#true} is VALID [2020-07-29 01:19:48,836 INFO L263 TraceCheckUtils]: 4: Hoare triple {254#true} call #t~ret8 := main(); {254#true} is VALID [2020-07-29 01:19:48,837 INFO L280 TraceCheckUtils]: 5: Hoare triple {254#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {259#(and (= 8 (select |#length| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-29 01:19:48,839 INFO L280 TraceCheckUtils]: 6: Hoare triple {259#(and (= 8 (select |#length| main_~a~0.base)) (= 0 main_~a~0.offset))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {259#(and (= 8 (select |#length| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-29 01:19:48,840 INFO L280 TraceCheckUtils]: 7: Hoare triple {259#(and (= 8 (select |#length| main_~a~0.base)) (= 0 main_~a~0.offset))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {259#(and (= 8 (select |#length| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-29 01:19:48,841 INFO L280 TraceCheckUtils]: 8: Hoare triple {259#(and (= 8 (select |#length| main_~a~0.base)) (= 0 main_~a~0.offset))} assume !(4 + ~a~0.offset <= #length[~a~0.base] && 0 <= ~a~0.offset); {255#false} is VALID [2020-07-29 01:19:48,842 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:19:48,842 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767815283] [2020-07-29 01:19:48,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:48,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:19:48,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836767730] [2020-07-29 01:19:48,845 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-07-29 01:19:48,845 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:48,845 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:19:48,860 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:19:48,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:19:48,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:48,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:19:48,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:19:48,862 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 4 states. [2020-07-29 01:19:49,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:49,111 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2020-07-29 01:19:49,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:19:49,111 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-07-29 01:19:49,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:49,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:19:49,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2020-07-29 01:19:49,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:19:49,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2020-07-29 01:19:49,116 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 46 transitions. [2020-07-29 01:19:49,192 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:49,195 INFO L225 Difference]: With dead ends: 44 [2020-07-29 01:19:49,195 INFO L226 Difference]: Without dead ends: 44 [2020-07-29 01:19:49,196 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:19:49,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-29 01:19:49,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-07-29 01:19:49,201 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:49,201 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2020-07-29 01:19:49,201 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2020-07-29 01:19:49,202 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2020-07-29 01:19:49,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:49,205 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2020-07-29 01:19:49,206 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2020-07-29 01:19:49,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:49,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:49,207 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2020-07-29 01:19:49,208 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2020-07-29 01:19:49,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:49,211 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2020-07-29 01:19:49,212 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2020-07-29 01:19:49,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:49,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:49,213 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:49,213 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:49,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-29 01:19:49,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2020-07-29 01:19:49,217 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 9 [2020-07-29 01:19:49,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:49,218 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2020-07-29 01:19:49,218 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:19:49,218 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2020-07-29 01:19:49,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-29 01:19:49,219 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:49,220 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:19:49,220 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-29 01:19:49,220 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, mainErr14ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-07-29 01:19:49,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:49,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1872231771, now seen corresponding path program 1 times [2020-07-29 01:19:49,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:49,222 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086170108] [2020-07-29 01:19:49,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:49,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:49,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:49,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:49,347 INFO L280 TraceCheckUtils]: 0: Hoare triple {446#(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; {439#true} is VALID [2020-07-29 01:19:49,347 INFO L280 TraceCheckUtils]: 1: Hoare triple {439#true} assume true; {439#true} is VALID [2020-07-29 01:19:49,348 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {439#true} {439#true} #106#return; {439#true} is VALID [2020-07-29 01:19:49,350 INFO L263 TraceCheckUtils]: 0: Hoare triple {439#true} call ULTIMATE.init(); {446#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:49,351 INFO L280 TraceCheckUtils]: 1: Hoare triple {446#(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; {439#true} is VALID [2020-07-29 01:19:49,351 INFO L280 TraceCheckUtils]: 2: Hoare triple {439#true} assume true; {439#true} is VALID [2020-07-29 01:19:49,352 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {439#true} {439#true} #106#return; {439#true} is VALID [2020-07-29 01:19:49,352 INFO L263 TraceCheckUtils]: 4: Hoare triple {439#true} call #t~ret8 := main(); {439#true} is VALID [2020-07-29 01:19:49,353 INFO L280 TraceCheckUtils]: 5: Hoare triple {439#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {439#true} is VALID [2020-07-29 01:19:49,353 INFO L280 TraceCheckUtils]: 6: Hoare triple {439#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {439#true} is VALID [2020-07-29 01:19:49,355 INFO L280 TraceCheckUtils]: 7: Hoare triple {439#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {444#(= main_~a~0.base main_~p~0.base)} is VALID [2020-07-29 01:19:49,357 INFO L280 TraceCheckUtils]: 8: Hoare triple {444#(= main_~a~0.base main_~p~0.base)} SUMMARY for call write~int(2, ~a~0.base, ~a~0.offset, 4); srcloc: L525 {445#(= 1 (select |#valid| main_~p~0.base))} is VALID [2020-07-29 01:19:49,359 INFO L280 TraceCheckUtils]: 9: Hoare triple {445#(= 1 (select |#valid| main_~p~0.base))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {445#(= 1 (select |#valid| main_~p~0.base))} is VALID [2020-07-29 01:19:49,360 INFO L280 TraceCheckUtils]: 10: Hoare triple {445#(= 1 (select |#valid| main_~p~0.base))} assume !(0 != #t~nondet3);havoc #t~nondet3; {445#(= 1 (select |#valid| main_~p~0.base))} is VALID [2020-07-29 01:19:49,361 INFO L280 TraceCheckUtils]: 11: Hoare triple {445#(= 1 (select |#valid| main_~p~0.base))} assume !(1 == #valid[~p~0.base]); {440#false} is VALID [2020-07-29 01:19:49,362 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:19:49,362 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086170108] [2020-07-29 01:19:49,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:49,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 01:19:49,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864926379] [2020-07-29 01:19:49,366 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-29 01:19:49,366 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:49,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:19:49,384 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:19:49,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-29 01:19:49,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:49,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:19:49,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:19:49,385 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 5 states. [2020-07-29 01:19:49,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:49,836 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2020-07-29 01:19:49,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:19:49,837 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-29 01:19:49,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:49,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:19:49,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2020-07-29 01:19:49,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:19:49,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2020-07-29 01:19:49,844 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 88 transitions. [2020-07-29 01:19:49,974 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:49,977 INFO L225 Difference]: With dead ends: 75 [2020-07-29 01:19:49,977 INFO L226 Difference]: Without dead ends: 75 [2020-07-29 01:19:49,978 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:19:49,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-07-29 01:19:49,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 48. [2020-07-29 01:19:49,983 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:49,983 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 48 states. [2020-07-29 01:19:49,983 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 48 states. [2020-07-29 01:19:49,984 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 48 states. [2020-07-29 01:19:49,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:49,988 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2020-07-29 01:19:49,988 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2020-07-29 01:19:49,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:49,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:49,989 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 75 states. [2020-07-29 01:19:49,990 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 75 states. [2020-07-29 01:19:49,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:49,994 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2020-07-29 01:19:49,994 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2020-07-29 01:19:49,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:49,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:49,996 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:49,996 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:49,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-29 01:19:49,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2020-07-29 01:19:49,999 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 12 [2020-07-29 01:19:49,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:49,999 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2020-07-29 01:19:49,999 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-29 01:19:50,000 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2020-07-29 01:19:50,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-29 01:19:50,000 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:50,001 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:19:50,001 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-29 01:19:50,001 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, mainErr14ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-07-29 01:19:50,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:50,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1872231770, now seen corresponding path program 1 times [2020-07-29 01:19:50,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:50,003 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045409124] [2020-07-29 01:19:50,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:50,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:50,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:50,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:50,168 INFO L280 TraceCheckUtils]: 0: Hoare triple {731#(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; {724#true} is VALID [2020-07-29 01:19:50,170 INFO L280 TraceCheckUtils]: 1: Hoare triple {724#true} assume true; {724#true} is VALID [2020-07-29 01:19:50,170 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {724#true} {724#true} #106#return; {724#true} is VALID [2020-07-29 01:19:50,171 INFO L263 TraceCheckUtils]: 0: Hoare triple {724#true} call ULTIMATE.init(); {731#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:50,171 INFO L280 TraceCheckUtils]: 1: Hoare triple {731#(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; {724#true} is VALID [2020-07-29 01:19:50,171 INFO L280 TraceCheckUtils]: 2: Hoare triple {724#true} assume true; {724#true} is VALID [2020-07-29 01:19:50,172 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {724#true} {724#true} #106#return; {724#true} is VALID [2020-07-29 01:19:50,172 INFO L263 TraceCheckUtils]: 4: Hoare triple {724#true} call #t~ret8 := main(); {724#true} is VALID [2020-07-29 01:19:50,173 INFO L280 TraceCheckUtils]: 5: Hoare triple {724#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {729#(and (= 0 main_~a~0.offset) (= (select |#length| main_~a~0.base) 8))} is VALID [2020-07-29 01:19:50,175 INFO L280 TraceCheckUtils]: 6: Hoare triple {729#(and (= 0 main_~a~0.offset) (= (select |#length| main_~a~0.base) 8))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {729#(and (= 0 main_~a~0.offset) (= (select |#length| main_~a~0.base) 8))} is VALID [2020-07-29 01:19:50,176 INFO L280 TraceCheckUtils]: 7: Hoare triple {729#(and (= 0 main_~a~0.offset) (= (select |#length| main_~a~0.base) 8))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {730#(and (= 8 (select |#length| main_~p~0.base)) (= 0 main_~p~0.offset))} is VALID [2020-07-29 01:19:50,178 INFO L280 TraceCheckUtils]: 8: Hoare triple {730#(and (= 8 (select |#length| main_~p~0.base)) (= 0 main_~p~0.offset))} SUMMARY for call write~int(2, ~a~0.base, ~a~0.offset, 4); srcloc: L525 {730#(and (= 8 (select |#length| main_~p~0.base)) (= 0 main_~p~0.offset))} is VALID [2020-07-29 01:19:50,179 INFO L280 TraceCheckUtils]: 9: Hoare triple {730#(and (= 8 (select |#length| main_~p~0.base)) (= 0 main_~p~0.offset))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {730#(and (= 8 (select |#length| main_~p~0.base)) (= 0 main_~p~0.offset))} is VALID [2020-07-29 01:19:50,180 INFO L280 TraceCheckUtils]: 10: Hoare triple {730#(and (= 8 (select |#length| main_~p~0.base)) (= 0 main_~p~0.offset))} assume !(0 != #t~nondet3);havoc #t~nondet3; {730#(and (= 8 (select |#length| main_~p~0.base)) (= 0 main_~p~0.offset))} is VALID [2020-07-29 01:19:50,181 INFO L280 TraceCheckUtils]: 11: Hoare triple {730#(and (= 8 (select |#length| main_~p~0.base)) (= 0 main_~p~0.offset))} assume !(4 + ~p~0.offset <= #length[~p~0.base] && 0 <= ~p~0.offset); {725#false} is VALID [2020-07-29 01:19:50,182 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:19:50,182 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045409124] [2020-07-29 01:19:50,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:50,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 01:19:50,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934618909] [2020-07-29 01:19:50,183 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-29 01:19:50,183 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:50,184 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:19:50,200 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:19:50,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-29 01:19:50,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:50,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:19:50,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:19:50,201 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand 5 states. [2020-07-29 01:19:50,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:50,578 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2020-07-29 01:19:50,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:19:50,578 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-29 01:19:50,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:50,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:19:50,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2020-07-29 01:19:50,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:19:50,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2020-07-29 01:19:50,584 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 71 transitions. [2020-07-29 01:19:50,698 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:50,700 INFO L225 Difference]: With dead ends: 64 [2020-07-29 01:19:50,701 INFO L226 Difference]: Without dead ends: 64 [2020-07-29 01:19:50,701 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:19:50,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-07-29 01:19:50,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 56. [2020-07-29 01:19:50,710 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:50,710 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 56 states. [2020-07-29 01:19:50,710 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 56 states. [2020-07-29 01:19:50,711 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 56 states. [2020-07-29 01:19:50,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:50,715 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2020-07-29 01:19:50,715 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2020-07-29 01:19:50,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:50,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:50,723 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 64 states. [2020-07-29 01:19:50,723 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 64 states. [2020-07-29 01:19:50,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:50,726 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2020-07-29 01:19:50,727 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2020-07-29 01:19:50,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:50,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:50,729 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:50,729 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:50,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-29 01:19:50,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2020-07-29 01:19:50,739 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 12 [2020-07-29 01:19:50,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:50,740 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2020-07-29 01:19:50,740 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-29 01:19:50,740 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2020-07-29 01:19:50,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-29 01:19:50,741 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:50,741 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:19:50,742 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-29 01:19:50,742 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, mainErr14ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-07-29 01:19:50,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:50,743 INFO L82 PathProgramCache]: Analyzing trace with hash -176116736, now seen corresponding path program 1 times [2020-07-29 01:19:50,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:50,743 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176485730] [2020-07-29 01:19:50,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:50,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:50,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:50,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:50,892 INFO L280 TraceCheckUtils]: 0: Hoare triple {992#(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; {984#true} is VALID [2020-07-29 01:19:50,892 INFO L280 TraceCheckUtils]: 1: Hoare triple {984#true} assume true; {984#true} is VALID [2020-07-29 01:19:50,893 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {984#true} {984#true} #106#return; {984#true} is VALID [2020-07-29 01:19:50,894 INFO L263 TraceCheckUtils]: 0: Hoare triple {984#true} call ULTIMATE.init(); {992#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:50,894 INFO L280 TraceCheckUtils]: 1: Hoare triple {992#(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; {984#true} is VALID [2020-07-29 01:19:50,894 INFO L280 TraceCheckUtils]: 2: Hoare triple {984#true} assume true; {984#true} is VALID [2020-07-29 01:19:50,895 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {984#true} {984#true} #106#return; {984#true} is VALID [2020-07-29 01:19:50,895 INFO L263 TraceCheckUtils]: 4: Hoare triple {984#true} call #t~ret8 := main(); {984#true} is VALID [2020-07-29 01:19:50,898 INFO L280 TraceCheckUtils]: 5: Hoare triple {984#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {989#(= 0 main_~a~0.offset)} is VALID [2020-07-29 01:19:50,900 INFO L280 TraceCheckUtils]: 6: Hoare triple {989#(= 0 main_~a~0.offset)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {990#(not (= 0 main_~a~0.base))} is VALID [2020-07-29 01:19:50,900 INFO L280 TraceCheckUtils]: 7: Hoare triple {990#(not (= 0 main_~a~0.base))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {990#(not (= 0 main_~a~0.base))} is VALID [2020-07-29 01:19:50,901 INFO L280 TraceCheckUtils]: 8: Hoare triple {990#(not (= 0 main_~a~0.base))} SUMMARY for call write~int(2, ~a~0.base, ~a~0.offset, 4); srcloc: L525 {990#(not (= 0 main_~a~0.base))} is VALID [2020-07-29 01:19:50,902 INFO L280 TraceCheckUtils]: 9: Hoare triple {990#(not (= 0 main_~a~0.base))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {990#(not (= 0 main_~a~0.base))} is VALID [2020-07-29 01:19:50,902 INFO L280 TraceCheckUtils]: 10: Hoare triple {990#(not (= 0 main_~a~0.base))} assume !(0 != #t~nondet3);havoc #t~nondet3; {990#(not (= 0 main_~a~0.base))} is VALID [2020-07-29 01:19:50,903 INFO L280 TraceCheckUtils]: 11: Hoare triple {990#(not (= 0 main_~a~0.base))} SUMMARY for call write~int(2, ~p~0.base, ~p~0.offset, 4); srcloc: L526-3 {990#(not (= 0 main_~a~0.base))} is VALID [2020-07-29 01:19:50,903 INFO L280 TraceCheckUtils]: 12: Hoare triple {990#(not (= 0 main_~a~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4); srcloc: L533 {990#(not (= 0 main_~a~0.base))} is VALID [2020-07-29 01:19:50,904 INFO L280 TraceCheckUtils]: 13: Hoare triple {990#(not (= 0 main_~a~0.base))} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {991#(not (= 0 main_~p~0.base))} is VALID [2020-07-29 01:19:50,905 INFO L280 TraceCheckUtils]: 14: Hoare triple {991#(not (= 0 main_~p~0.base))} assume !(~p~0.base != 0 || ~p~0.offset != 0); {985#false} is VALID [2020-07-29 01:19:50,906 INFO L280 TraceCheckUtils]: 15: Hoare triple {985#false} #res := 0; {985#false} is VALID [2020-07-29 01:19:50,906 INFO L280 TraceCheckUtils]: 16: Hoare triple {985#false} assume !(#valid == old(#valid)); {985#false} is VALID [2020-07-29 01:19:50,906 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:19:50,907 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176485730] [2020-07-29 01:19:50,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:50,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-29 01:19:50,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633440050] [2020-07-29 01:19:50,908 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-07-29 01:19:50,908 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:50,908 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:19:50,930 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:50,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-29 01:19:50,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:50,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:19:50,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:19:50,931 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand 6 states. [2020-07-29 01:19:51,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:51,263 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2020-07-29 01:19:51,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:19:51,264 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-07-29 01:19:51,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:51,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:19:51,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2020-07-29 01:19:51,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:19:51,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2020-07-29 01:19:51,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 62 transitions. [2020-07-29 01:19:51,340 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:51,342 INFO L225 Difference]: With dead ends: 61 [2020-07-29 01:19:51,342 INFO L226 Difference]: Without dead ends: 61 [2020-07-29 01:19:51,343 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-29 01:19:51,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-07-29 01:19:51,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2020-07-29 01:19:51,350 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:51,350 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 56 states. [2020-07-29 01:19:51,350 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 56 states. [2020-07-29 01:19:51,350 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 56 states. [2020-07-29 01:19:51,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:51,354 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2020-07-29 01:19:51,354 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2020-07-29 01:19:51,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:51,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:51,356 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 61 states. [2020-07-29 01:19:51,357 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 61 states. [2020-07-29 01:19:51,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:51,360 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2020-07-29 01:19:51,361 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2020-07-29 01:19:51,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:51,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:51,361 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:51,361 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:51,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-29 01:19:51,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2020-07-29 01:19:51,364 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 17 [2020-07-29 01:19:51,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:51,364 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2020-07-29 01:19:51,364 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-29 01:19:51,364 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2020-07-29 01:19:51,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-29 01:19:51,365 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:51,365 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:19:51,365 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-29 01:19:51,365 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, mainErr14ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-07-29 01:19:51,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:51,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1164610614, now seen corresponding path program 1 times [2020-07-29 01:19:51,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:51,366 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469594431] [2020-07-29 01:19:51,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:51,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:51,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:51,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:51,507 INFO L280 TraceCheckUtils]: 0: Hoare triple {1248#(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; {1238#true} is VALID [2020-07-29 01:19:51,508 INFO L280 TraceCheckUtils]: 1: Hoare triple {1238#true} assume true; {1238#true} is VALID [2020-07-29 01:19:51,508 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1238#true} {1238#true} #106#return; {1238#true} is VALID [2020-07-29 01:19:51,509 INFO L263 TraceCheckUtils]: 0: Hoare triple {1238#true} call ULTIMATE.init(); {1248#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:51,509 INFO L280 TraceCheckUtils]: 1: Hoare triple {1248#(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; {1238#true} is VALID [2020-07-29 01:19:51,509 INFO L280 TraceCheckUtils]: 2: Hoare triple {1238#true} assume true; {1238#true} is VALID [2020-07-29 01:19:51,510 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1238#true} {1238#true} #106#return; {1238#true} is VALID [2020-07-29 01:19:51,510 INFO L263 TraceCheckUtils]: 4: Hoare triple {1238#true} call #t~ret8 := main(); {1238#true} is VALID [2020-07-29 01:19:51,510 INFO L280 TraceCheckUtils]: 5: Hoare triple {1238#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {1238#true} is VALID [2020-07-29 01:19:51,510 INFO L280 TraceCheckUtils]: 6: Hoare triple {1238#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {1238#true} is VALID [2020-07-29 01:19:51,511 INFO L280 TraceCheckUtils]: 7: Hoare triple {1238#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1243#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-29 01:19:51,512 INFO L280 TraceCheckUtils]: 8: Hoare triple {1243#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} SUMMARY for call write~int(2, ~a~0.base, ~a~0.offset, 4); srcloc: L525 {1243#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-29 01:19:51,517 INFO L280 TraceCheckUtils]: 9: Hoare triple {1243#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1243#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-29 01:19:51,517 INFO L280 TraceCheckUtils]: 10: Hoare triple {1243#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet3);havoc #t~nondet3; {1243#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-29 01:19:51,518 INFO L280 TraceCheckUtils]: 11: Hoare triple {1243#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} SUMMARY for call write~int(2, ~p~0.base, ~p~0.offset, 4); srcloc: L526-3 {1244#(and (= main_~a~0.base main_~p~0.base) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-29 01:19:51,520 INFO L280 TraceCheckUtils]: 12: Hoare triple {1244#(and (= main_~a~0.base main_~p~0.base) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~a~0.offset main_~p~0.offset))} SUMMARY for call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4); srcloc: L533 {1245#(= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))} is VALID [2020-07-29 01:19:51,520 INFO L280 TraceCheckUtils]: 13: Hoare triple {1245#(= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1246#(= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-29 01:19:51,526 INFO L280 TraceCheckUtils]: 14: Hoare triple {1246#(= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !!(~p~0.base != 0 || ~p~0.offset != 0); {1246#(= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-29 01:19:51,527 INFO L280 TraceCheckUtils]: 15: Hoare triple {1246#(= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} SUMMARY for call #t~mem6 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L537 {1247#(= 2 |main_#t~mem6|)} is VALID [2020-07-29 01:19:51,527 INFO L280 TraceCheckUtils]: 16: Hoare triple {1247#(= 2 |main_#t~mem6|)} assume 2 != #t~mem6;havoc #t~mem6; {1239#false} is VALID [2020-07-29 01:19:51,528 INFO L280 TraceCheckUtils]: 17: Hoare triple {1239#false} assume !false; {1239#false} is VALID [2020-07-29 01:19:51,528 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:19:51,529 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469594431] [2020-07-29 01:19:51,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:51,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-29 01:19:51,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549874028] [2020-07-29 01:19:51,530 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-07-29 01:19:51,530 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:51,530 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-29 01:19:51,555 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:51,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-29 01:19:51,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:51,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-29 01:19:51,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-07-29 01:19:51,557 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 8 states. [2020-07-29 01:19:52,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:52,079 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2020-07-29 01:19:52,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:19:52,080 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-07-29 01:19:52,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:52,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:19:52,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2020-07-29 01:19:52,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:19:52,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2020-07-29 01:19:52,084 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 80 transitions. [2020-07-29 01:19:52,192 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:52,194 INFO L225 Difference]: With dead ends: 77 [2020-07-29 01:19:52,194 INFO L226 Difference]: Without dead ends: 77 [2020-07-29 01:19:52,195 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:19:52,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-07-29 01:19:52,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 57. [2020-07-29 01:19:52,199 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:52,203 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand 57 states. [2020-07-29 01:19:52,203 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 57 states. [2020-07-29 01:19:52,203 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 57 states. [2020-07-29 01:19:52,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:52,206 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2020-07-29 01:19:52,207 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2020-07-29 01:19:52,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:52,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:52,207 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 77 states. [2020-07-29 01:19:52,208 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 77 states. [2020-07-29 01:19:52,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:52,211 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2020-07-29 01:19:52,212 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2020-07-29 01:19:52,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:52,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:52,213 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:52,213 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:52,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-07-29 01:19:52,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2020-07-29 01:19:52,215 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 18 [2020-07-29 01:19:52,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:52,215 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2020-07-29 01:19:52,216 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-29 01:19:52,216 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2020-07-29 01:19:52,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-29 01:19:52,216 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:52,217 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:19:52,217 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-29 01:19:52,218 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, mainErr14ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-07-29 01:19:52,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:52,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1067762024, now seen corresponding path program 1 times [2020-07-29 01:19:52,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:52,219 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765178743] [2020-07-29 01:19:52,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:52,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:52,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:52,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:52,324 INFO L280 TraceCheckUtils]: 0: Hoare triple {1550#(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; {1541#true} is VALID [2020-07-29 01:19:52,325 INFO L280 TraceCheckUtils]: 1: Hoare triple {1541#true} assume true; {1541#true} is VALID [2020-07-29 01:19:52,325 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1541#true} {1541#true} #106#return; {1541#true} is VALID [2020-07-29 01:19:52,326 INFO L263 TraceCheckUtils]: 0: Hoare triple {1541#true} call ULTIMATE.init(); {1550#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:52,326 INFO L280 TraceCheckUtils]: 1: Hoare triple {1550#(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; {1541#true} is VALID [2020-07-29 01:19:52,326 INFO L280 TraceCheckUtils]: 2: Hoare triple {1541#true} assume true; {1541#true} is VALID [2020-07-29 01:19:52,327 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1541#true} {1541#true} #106#return; {1541#true} is VALID [2020-07-29 01:19:52,327 INFO L263 TraceCheckUtils]: 4: Hoare triple {1541#true} call #t~ret8 := main(); {1541#true} is VALID [2020-07-29 01:19:52,327 INFO L280 TraceCheckUtils]: 5: Hoare triple {1541#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {1541#true} is VALID [2020-07-29 01:19:52,327 INFO L280 TraceCheckUtils]: 6: Hoare triple {1541#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {1541#true} is VALID [2020-07-29 01:19:52,328 INFO L280 TraceCheckUtils]: 7: Hoare triple {1541#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1541#true} is VALID [2020-07-29 01:19:52,328 INFO L280 TraceCheckUtils]: 8: Hoare triple {1541#true} SUMMARY for call write~int(2, ~a~0.base, ~a~0.offset, 4); srcloc: L525 {1541#true} is VALID [2020-07-29 01:19:52,328 INFO L280 TraceCheckUtils]: 9: Hoare triple {1541#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1541#true} is VALID [2020-07-29 01:19:52,328 INFO L280 TraceCheckUtils]: 10: Hoare triple {1541#true} assume !!(0 != #t~nondet3);havoc #t~nondet3; {1541#true} is VALID [2020-07-29 01:19:52,329 INFO L280 TraceCheckUtils]: 11: Hoare triple {1541#true} SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset, 4); srcloc: L527 {1541#true} is VALID [2020-07-29 01:19:52,330 INFO L280 TraceCheckUtils]: 12: Hoare triple {1541#true} call #t~malloc4.base, #t~malloc4.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc4.base, #t~malloc4.offset; {1546#(= 1 (select |#valid| main_~t~0.base))} is VALID [2020-07-29 01:19:52,331 INFO L280 TraceCheckUtils]: 13: Hoare triple {1546#(= 1 (select |#valid| main_~t~0.base))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {1546#(= 1 (select |#valid| main_~t~0.base))} is VALID [2020-07-29 01:19:52,332 INFO L280 TraceCheckUtils]: 14: Hoare triple {1546#(= 1 (select |#valid| main_~t~0.base))} SUMMARY for call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4); srcloc: L529-3 {1547#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2020-07-29 01:19:52,333 INFO L280 TraceCheckUtils]: 15: Hoare triple {1547#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); srcloc: L530 {1548#(= (select |#valid| |main_#t~mem5.base|) 1)} is VALID [2020-07-29 01:19:52,334 INFO L280 TraceCheckUtils]: 16: Hoare triple {1548#(= (select |#valid| |main_#t~mem5.base|) 1)} ~p~0.base, ~p~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {1549#(= 1 (select |#valid| main_~p~0.base))} is VALID [2020-07-29 01:19:52,335 INFO L280 TraceCheckUtils]: 17: Hoare triple {1549#(= 1 (select |#valid| main_~p~0.base))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1549#(= 1 (select |#valid| main_~p~0.base))} is VALID [2020-07-29 01:19:52,335 INFO L280 TraceCheckUtils]: 18: Hoare triple {1549#(= 1 (select |#valid| main_~p~0.base))} assume !(0 != #t~nondet3);havoc #t~nondet3; {1549#(= 1 (select |#valid| main_~p~0.base))} is VALID [2020-07-29 01:19:52,336 INFO L280 TraceCheckUtils]: 19: Hoare triple {1549#(= 1 (select |#valid| main_~p~0.base))} assume !(1 == #valid[~p~0.base]); {1542#false} is VALID [2020-07-29 01:19:52,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:19:52,337 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765178743] [2020-07-29 01:19:52,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:52,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-29 01:19:52,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451762225] [2020-07-29 01:19:52,338 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-07-29 01:19:52,338 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:52,338 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:19:52,364 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:52,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-29 01:19:52,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:52,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 01:19:52,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:19:52,365 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 7 states. [2020-07-29 01:19:52,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:52,983 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2020-07-29 01:19:52,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:19:52,984 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-07-29 01:19:52,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:52,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:19:52,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2020-07-29 01:19:52,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:19:52,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2020-07-29 01:19:52,989 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 62 transitions. [2020-07-29 01:19:53,088 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:53,089 INFO L225 Difference]: With dead ends: 69 [2020-07-29 01:19:53,089 INFO L226 Difference]: Without dead ends: 69 [2020-07-29 01:19:53,090 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:19:53,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-07-29 01:19:53,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 55. [2020-07-29 01:19:53,098 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:53,098 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 55 states. [2020-07-29 01:19:53,099 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 55 states. [2020-07-29 01:19:53,100 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 55 states. [2020-07-29 01:19:53,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:53,102 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2020-07-29 01:19:53,103 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2020-07-29 01:19:53,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:53,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:53,103 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 69 states. [2020-07-29 01:19:53,104 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 69 states. [2020-07-29 01:19:53,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:53,107 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2020-07-29 01:19:53,107 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2020-07-29 01:19:53,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:53,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:53,108 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:53,108 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:53,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-29 01:19:53,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2020-07-29 01:19:53,111 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 20 [2020-07-29 01:19:53,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:53,112 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2020-07-29 01:19:53,112 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-29 01:19:53,112 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2020-07-29 01:19:53,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-29 01:19:53,112 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:53,113 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:19:53,113 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-29 01:19:53,113 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, mainErr14ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-07-29 01:19:53,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:53,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1067762023, now seen corresponding path program 1 times [2020-07-29 01:19:53,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:53,115 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627549086] [2020-07-29 01:19:53,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:53,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:53,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:53,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:53,292 INFO L280 TraceCheckUtils]: 0: Hoare triple {1831#(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; {1822#true} is VALID [2020-07-29 01:19:53,292 INFO L280 TraceCheckUtils]: 1: Hoare triple {1822#true} assume true; {1822#true} is VALID [2020-07-29 01:19:53,292 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1822#true} {1822#true} #106#return; {1822#true} is VALID [2020-07-29 01:19:53,293 INFO L263 TraceCheckUtils]: 0: Hoare triple {1822#true} call ULTIMATE.init(); {1831#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:53,294 INFO L280 TraceCheckUtils]: 1: Hoare triple {1831#(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; {1822#true} is VALID [2020-07-29 01:19:53,294 INFO L280 TraceCheckUtils]: 2: Hoare triple {1822#true} assume true; {1822#true} is VALID [2020-07-29 01:19:53,294 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1822#true} {1822#true} #106#return; {1822#true} is VALID [2020-07-29 01:19:53,294 INFO L263 TraceCheckUtils]: 4: Hoare triple {1822#true} call #t~ret8 := main(); {1822#true} is VALID [2020-07-29 01:19:53,295 INFO L280 TraceCheckUtils]: 5: Hoare triple {1822#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {1822#true} is VALID [2020-07-29 01:19:53,295 INFO L280 TraceCheckUtils]: 6: Hoare triple {1822#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {1822#true} is VALID [2020-07-29 01:19:53,295 INFO L280 TraceCheckUtils]: 7: Hoare triple {1822#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1822#true} is VALID [2020-07-29 01:19:53,295 INFO L280 TraceCheckUtils]: 8: Hoare triple {1822#true} SUMMARY for call write~int(2, ~a~0.base, ~a~0.offset, 4); srcloc: L525 {1822#true} is VALID [2020-07-29 01:19:53,296 INFO L280 TraceCheckUtils]: 9: Hoare triple {1822#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1822#true} is VALID [2020-07-29 01:19:53,296 INFO L280 TraceCheckUtils]: 10: Hoare triple {1822#true} assume !!(0 != #t~nondet3);havoc #t~nondet3; {1822#true} is VALID [2020-07-29 01:19:53,296 INFO L280 TraceCheckUtils]: 11: Hoare triple {1822#true} SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset, 4); srcloc: L527 {1822#true} is VALID [2020-07-29 01:19:53,297 INFO L280 TraceCheckUtils]: 12: Hoare triple {1822#true} call #t~malloc4.base, #t~malloc4.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc4.base, #t~malloc4.offset; {1827#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~t~0.offset))} is VALID [2020-07-29 01:19:53,298 INFO L280 TraceCheckUtils]: 13: Hoare triple {1827#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~t~0.offset))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {1827#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~t~0.offset))} is VALID [2020-07-29 01:19:53,300 INFO L280 TraceCheckUtils]: 14: Hoare triple {1827#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~t~0.offset))} SUMMARY for call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4); srcloc: L529-3 {1828#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2020-07-29 01:19:53,301 INFO L280 TraceCheckUtils]: 15: Hoare triple {1828#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); srcloc: L530 {1829#(and (= 0 |main_#t~mem5.offset|) (= 8 (select |#length| |main_#t~mem5.base|)))} is VALID [2020-07-29 01:19:53,302 INFO L280 TraceCheckUtils]: 16: Hoare triple {1829#(and (= 0 |main_#t~mem5.offset|) (= 8 (select |#length| |main_#t~mem5.base|)))} ~p~0.base, ~p~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {1830#(and (= 8 (select |#length| main_~p~0.base)) (= 0 main_~p~0.offset))} is VALID [2020-07-29 01:19:53,303 INFO L280 TraceCheckUtils]: 17: Hoare triple {1830#(and (= 8 (select |#length| main_~p~0.base)) (= 0 main_~p~0.offset))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1830#(and (= 8 (select |#length| main_~p~0.base)) (= 0 main_~p~0.offset))} is VALID [2020-07-29 01:19:53,304 INFO L280 TraceCheckUtils]: 18: Hoare triple {1830#(and (= 8 (select |#length| main_~p~0.base)) (= 0 main_~p~0.offset))} assume !(0 != #t~nondet3);havoc #t~nondet3; {1830#(and (= 8 (select |#length| main_~p~0.base)) (= 0 main_~p~0.offset))} is VALID [2020-07-29 01:19:53,305 INFO L280 TraceCheckUtils]: 19: Hoare triple {1830#(and (= 8 (select |#length| main_~p~0.base)) (= 0 main_~p~0.offset))} assume !(4 + ~p~0.offset <= #length[~p~0.base] && 0 <= ~p~0.offset); {1823#false} is VALID [2020-07-29 01:19:53,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:19:53,306 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627549086] [2020-07-29 01:19:53,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:53,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-29 01:19:53,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201085535] [2020-07-29 01:19:53,307 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-07-29 01:19:53,308 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:53,308 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:19:53,332 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:53,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-29 01:19:53,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:53,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 01:19:53,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:19:53,333 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 7 states. [2020-07-29 01:19:54,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:54,014 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2020-07-29 01:19:54,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-29 01:19:54,015 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-07-29 01:19:54,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:54,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:19:54,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2020-07-29 01:19:54,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:19:54,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2020-07-29 01:19:54,020 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 64 transitions. [2020-07-29 01:19:54,111 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:54,113 INFO L225 Difference]: With dead ends: 65 [2020-07-29 01:19:54,113 INFO L226 Difference]: Without dead ends: 65 [2020-07-29 01:19:54,113 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-07-29 01:19:54,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-07-29 01:19:54,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 45. [2020-07-29 01:19:54,116 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:54,116 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 45 states. [2020-07-29 01:19:54,117 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 45 states. [2020-07-29 01:19:54,117 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 45 states. [2020-07-29 01:19:54,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:54,119 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2020-07-29 01:19:54,119 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2020-07-29 01:19:54,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:54,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:54,120 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 65 states. [2020-07-29 01:19:54,120 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 65 states. [2020-07-29 01:19:54,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:54,122 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2020-07-29 01:19:54,122 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2020-07-29 01:19:54,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:54,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:54,123 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:54,123 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:54,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-29 01:19:54,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2020-07-29 01:19:54,125 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 20 [2020-07-29 01:19:54,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:54,125 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2020-07-29 01:19:54,125 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-29 01:19:54,125 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2020-07-29 01:19:54,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-29 01:19:54,126 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:54,126 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:19:54,126 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-29 01:19:54,126 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, mainErr14ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-07-29 01:19:54,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:54,127 INFO L82 PathProgramCache]: Analyzing trace with hash -164132145, now seen corresponding path program 1 times [2020-07-29 01:19:54,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:54,127 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692534196] [2020-07-29 01:19:54,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:54,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:54,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:54,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:54,347 INFO L280 TraceCheckUtils]: 0: Hoare triple {2096#(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; {2085#true} is VALID [2020-07-29 01:19:54,347 INFO L280 TraceCheckUtils]: 1: Hoare triple {2085#true} assume true; {2085#true} is VALID [2020-07-29 01:19:54,348 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2085#true} {2085#true} #106#return; {2085#true} is VALID [2020-07-29 01:19:54,349 INFO L263 TraceCheckUtils]: 0: Hoare triple {2085#true} call ULTIMATE.init(); {2096#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:54,349 INFO L280 TraceCheckUtils]: 1: Hoare triple {2096#(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; {2085#true} is VALID [2020-07-29 01:19:54,349 INFO L280 TraceCheckUtils]: 2: Hoare triple {2085#true} assume true; {2085#true} is VALID [2020-07-29 01:19:54,349 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2085#true} {2085#true} #106#return; {2085#true} is VALID [2020-07-29 01:19:54,350 INFO L263 TraceCheckUtils]: 4: Hoare triple {2085#true} call #t~ret8 := main(); {2085#true} is VALID [2020-07-29 01:19:54,352 INFO L280 TraceCheckUtils]: 5: Hoare triple {2085#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {2090#(= 0 main_~a~0.offset)} is VALID [2020-07-29 01:19:54,352 INFO L280 TraceCheckUtils]: 6: Hoare triple {2090#(= 0 main_~a~0.offset)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {2090#(= 0 main_~a~0.offset)} is VALID [2020-07-29 01:19:54,353 INFO L280 TraceCheckUtils]: 7: Hoare triple {2090#(= 0 main_~a~0.offset)} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2091#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset))} is VALID [2020-07-29 01:19:54,357 INFO L280 TraceCheckUtils]: 8: Hoare triple {2091#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset))} SUMMARY for call write~int(2, ~a~0.base, ~a~0.offset, 4); srcloc: L525 {2091#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset))} is VALID [2020-07-29 01:19:54,358 INFO L280 TraceCheckUtils]: 9: Hoare triple {2091#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2091#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset))} is VALID [2020-07-29 01:19:54,360 INFO L280 TraceCheckUtils]: 10: Hoare triple {2091#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset))} assume !(0 != #t~nondet3);havoc #t~nondet3; {2091#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset))} is VALID [2020-07-29 01:19:54,361 INFO L280 TraceCheckUtils]: 11: Hoare triple {2091#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset))} SUMMARY for call write~int(2, ~p~0.base, ~p~0.offset, 4); srcloc: L526-3 {2091#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset))} is VALID [2020-07-29 01:19:54,363 INFO L280 TraceCheckUtils]: 12: Hoare triple {2091#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset))} SUMMARY for call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4); srcloc: L533 {2092#(and (= 0 (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4)) (= 0 main_~a~0.offset))} is VALID [2020-07-29 01:19:54,364 INFO L280 TraceCheckUtils]: 13: Hoare triple {2092#(and (= 0 (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4)) (= 0 main_~a~0.offset))} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2093#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2020-07-29 01:19:54,365 INFO L280 TraceCheckUtils]: 14: Hoare triple {2093#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume !!(~p~0.base != 0 || ~p~0.offset != 0); {2093#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2020-07-29 01:19:54,366 INFO L280 TraceCheckUtils]: 15: Hoare triple {2093#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} SUMMARY for call #t~mem6 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L537 {2093#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2020-07-29 01:19:54,367 INFO L280 TraceCheckUtils]: 16: Hoare triple {2093#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume !(2 != #t~mem6);havoc #t~mem6; {2093#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2020-07-29 01:19:54,368 INFO L280 TraceCheckUtils]: 17: Hoare triple {2093#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} SUMMARY for call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); srcloc: L537-3 {2094#(and (= 0 |main_#t~mem7.base|) (= 0 |main_#t~mem7.offset|))} is VALID [2020-07-29 01:19:54,369 INFO L280 TraceCheckUtils]: 18: Hoare triple {2094#(and (= 0 |main_#t~mem7.base|) (= 0 |main_#t~mem7.offset|))} ~p~0.base, ~p~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {2095#(and (= 0 main_~p~0.offset) (= 0 main_~p~0.base))} is VALID [2020-07-29 01:19:54,370 INFO L280 TraceCheckUtils]: 19: Hoare triple {2095#(and (= 0 main_~p~0.offset) (= 0 main_~p~0.base))} assume !!(~p~0.base != 0 || ~p~0.offset != 0); {2086#false} is VALID [2020-07-29 01:19:54,370 INFO L280 TraceCheckUtils]: 20: Hoare triple {2086#false} assume !(1 == #valid[~p~0.base]); {2086#false} is VALID [2020-07-29 01:19:54,372 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:19:54,372 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692534196] [2020-07-29 01:19:54,372 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701774550] [2020-07-29 01:19:54,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:19:54,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:54,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 23 conjunts are in the unsatisfiable core [2020-07-29 01:19:54,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:54,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:19:54,781 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-29 01:19:54,781 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:19:54,790 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:19:54,795 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-29 01:19:54,796 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-29 01:19:54,804 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:19:54,805 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:19:54,805 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2020-07-29 01:19:54,899 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-29 01:19:54,899 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:19:54,907 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:19:54,910 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-29 01:19:54,911 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-29 01:19:54,916 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:19:54,917 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:19:54,917 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2020-07-29 01:19:54,921 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:19:54,922 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, main_~p~0.base, |#memory_$Pointer$.offset|]. (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (.cse1 (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4))) (and (= .cse0 |main_#t~mem7.base|) (= |main_#t~mem7.offset| .cse1) (= 0 .cse0) (= 0 .cse1))) [2020-07-29 01:19:54,922 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 |main_#t~mem7.base|) (= 0 |main_#t~mem7.offset|)) [2020-07-29 01:19:54,931 INFO L263 TraceCheckUtils]: 0: Hoare triple {2085#true} call ULTIMATE.init(); {2085#true} is VALID [2020-07-29 01:19:54,932 INFO L280 TraceCheckUtils]: 1: Hoare triple {2085#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2085#true} is VALID [2020-07-29 01:19:54,932 INFO L280 TraceCheckUtils]: 2: Hoare triple {2085#true} assume true; {2085#true} is VALID [2020-07-29 01:19:54,932 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2085#true} {2085#true} #106#return; {2085#true} is VALID [2020-07-29 01:19:54,933 INFO L263 TraceCheckUtils]: 4: Hoare triple {2085#true} call #t~ret8 := main(); {2085#true} is VALID [2020-07-29 01:19:54,934 INFO L280 TraceCheckUtils]: 5: Hoare triple {2085#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {2115#(<= main_~a~0.offset 0)} is VALID [2020-07-29 01:19:54,935 INFO L280 TraceCheckUtils]: 6: Hoare triple {2115#(<= main_~a~0.offset 0)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {2115#(<= main_~a~0.offset 0)} is VALID [2020-07-29 01:19:54,936 INFO L280 TraceCheckUtils]: 7: Hoare triple {2115#(<= main_~a~0.offset 0)} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2122#(and (= main_~a~0.base main_~p~0.base) (<= main_~p~0.offset main_~a~0.offset) (<= main_~a~0.offset 0))} is VALID [2020-07-29 01:19:54,938 INFO L280 TraceCheckUtils]: 8: Hoare triple {2122#(and (= main_~a~0.base main_~p~0.base) (<= main_~p~0.offset main_~a~0.offset) (<= main_~a~0.offset 0))} SUMMARY for call write~int(2, ~a~0.base, ~a~0.offset, 4); srcloc: L525 {2122#(and (= main_~a~0.base main_~p~0.base) (<= main_~p~0.offset main_~a~0.offset) (<= main_~a~0.offset 0))} is VALID [2020-07-29 01:19:54,940 INFO L280 TraceCheckUtils]: 9: Hoare triple {2122#(and (= main_~a~0.base main_~p~0.base) (<= main_~p~0.offset main_~a~0.offset) (<= main_~a~0.offset 0))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2122#(and (= main_~a~0.base main_~p~0.base) (<= main_~p~0.offset main_~a~0.offset) (<= main_~a~0.offset 0))} is VALID [2020-07-29 01:19:54,941 INFO L280 TraceCheckUtils]: 10: Hoare triple {2122#(and (= main_~a~0.base main_~p~0.base) (<= main_~p~0.offset main_~a~0.offset) (<= main_~a~0.offset 0))} assume !(0 != #t~nondet3);havoc #t~nondet3; {2122#(and (= main_~a~0.base main_~p~0.base) (<= main_~p~0.offset main_~a~0.offset) (<= main_~a~0.offset 0))} is VALID [2020-07-29 01:19:54,943 INFO L280 TraceCheckUtils]: 11: Hoare triple {2122#(and (= main_~a~0.base main_~p~0.base) (<= main_~p~0.offset main_~a~0.offset) (<= main_~a~0.offset 0))} SUMMARY for call write~int(2, ~p~0.base, ~p~0.offset, 4); srcloc: L526-3 {2091#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset))} is VALID [2020-07-29 01:19:54,945 INFO L280 TraceCheckUtils]: 12: Hoare triple {2091#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset))} SUMMARY for call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4); srcloc: L533 {2092#(and (= 0 (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4)) (= 0 main_~a~0.offset))} is VALID [2020-07-29 01:19:54,947 INFO L280 TraceCheckUtils]: 13: Hoare triple {2092#(and (= 0 (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4)) (= 0 main_~a~0.offset))} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2141#(and (<= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4)) (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)))} is VALID [2020-07-29 01:19:54,948 INFO L280 TraceCheckUtils]: 14: Hoare triple {2141#(and (<= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4)) (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)))} assume !!(~p~0.base != 0 || ~p~0.offset != 0); {2141#(and (<= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4)) (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)))} is VALID [2020-07-29 01:19:54,949 INFO L280 TraceCheckUtils]: 15: Hoare triple {2141#(and (<= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4)) (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)))} SUMMARY for call #t~mem6 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L537 {2093#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2020-07-29 01:19:54,950 INFO L280 TraceCheckUtils]: 16: Hoare triple {2093#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume !(2 != #t~mem6);havoc #t~mem6; {2093#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2020-07-29 01:19:54,952 INFO L280 TraceCheckUtils]: 17: Hoare triple {2093#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} SUMMARY for call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); srcloc: L537-3 {2094#(and (= 0 |main_#t~mem7.base|) (= 0 |main_#t~mem7.offset|))} is VALID [2020-07-29 01:19:54,953 INFO L280 TraceCheckUtils]: 18: Hoare triple {2094#(and (= 0 |main_#t~mem7.base|) (= 0 |main_#t~mem7.offset|))} ~p~0.base, ~p~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {2095#(and (= 0 main_~p~0.offset) (= 0 main_~p~0.base))} is VALID [2020-07-29 01:19:54,954 INFO L280 TraceCheckUtils]: 19: Hoare triple {2095#(and (= 0 main_~p~0.offset) (= 0 main_~p~0.base))} assume !!(~p~0.base != 0 || ~p~0.offset != 0); {2086#false} is VALID [2020-07-29 01:19:54,954 INFO L280 TraceCheckUtils]: 20: Hoare triple {2086#false} assume !(1 == #valid[~p~0.base]); {2086#false} is VALID [2020-07-29 01:19:54,956 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:19:54,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:19:54,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 12 [2020-07-29 01:19:54,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206673343] [2020-07-29 01:19:54,960 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2020-07-29 01:19:54,960 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:54,960 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-29 01:19:55,016 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:55,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-29 01:19:55,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:55,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-29 01:19:55,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-07-29 01:19:55,017 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 12 states. [2020-07-29 01:19:55,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:55,772 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2020-07-29 01:19:55,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-29 01:19:55,773 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2020-07-29 01:19:55,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:55,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-29 01:19:55,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 63 transitions. [2020-07-29 01:19:55,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-29 01:19:55,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 63 transitions. [2020-07-29 01:19:55,776 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 63 transitions. [2020-07-29 01:19:55,866 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:55,868 INFO L225 Difference]: With dead ends: 61 [2020-07-29 01:19:55,868 INFO L226 Difference]: Without dead ends: 61 [2020-07-29 01:19:55,869 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2020-07-29 01:19:55,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-07-29 01:19:55,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 48. [2020-07-29 01:19:55,874 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:55,874 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 48 states. [2020-07-29 01:19:55,874 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 48 states. [2020-07-29 01:19:55,874 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 48 states. [2020-07-29 01:19:55,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:55,876 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2020-07-29 01:19:55,876 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2020-07-29 01:19:55,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:55,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:55,877 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 61 states. [2020-07-29 01:19:55,877 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 61 states. [2020-07-29 01:19:55,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:55,879 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2020-07-29 01:19:55,879 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2020-07-29 01:19:55,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:55,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:55,880 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:55,880 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:55,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-29 01:19:55,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2020-07-29 01:19:55,882 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 21 [2020-07-29 01:19:55,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:55,882 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2020-07-29 01:19:55,882 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-29 01:19:55,882 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2020-07-29 01:19:55,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-29 01:19:55,883 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:55,883 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, 1] [2020-07-29 01:19:56,096 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2020-07-29 01:19:56,097 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, mainErr14ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-07-29 01:19:56,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:56,098 INFO L82 PathProgramCache]: Analyzing trace with hash -793130470, now seen corresponding path program 1 times [2020-07-29 01:19:56,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:56,099 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488231186] [2020-07-29 01:19:56,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:56,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:19:56,118 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:19:56,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:19:56,131 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:19:56,168 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:19:56,168 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-29 01:19:56,168 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-29 01:19:56,191 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2020-07-29 01:19:56,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.07 01:19:56 BoogieIcfgContainer [2020-07-29 01:19:56,219 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-29 01:19:56,219 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:19:56,219 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:19:56,219 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:19:56,220 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:19:47" (3/4) ... [2020-07-29 01:19:56,222 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-07-29 01:19:56,237 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2020-07-29 01:19:56,310 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-29 01:19:56,311 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:19:56,313 INFO L168 Benchmark]: Toolchain (without parser) took 10291.75 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 278.4 MB). Free memory was 956.2 MB in the beginning and 870.3 MB in the end (delta: 85.9 MB). Peak memory consumption was 364.3 MB. Max. memory is 11.5 GB. [2020-07-29 01:19:56,314 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:19:56,314 INFO L168 Benchmark]: CACSL2BoogieTranslator took 772.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -166.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2020-07-29 01:19:56,320 INFO L168 Benchmark]: Boogie Preprocessor took 121.35 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:19:56,320 INFO L168 Benchmark]: RCFGBuilder took 813.97 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: 58.1 MB). Peak memory consumption was 58.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:19:56,324 INFO L168 Benchmark]: TraceAbstraction took 8484.22 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 130.0 MB). Free memory was 1.1 GB in the beginning and 870.3 MB in the end (delta: 180.6 MB). Peak memory consumption was 310.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:19:56,325 INFO L168 Benchmark]: Witness Printer took 91.84 ms. Allocated memory is still 1.3 GB. Free memory is still 870.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:19:56,327 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.30 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 772.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -166.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 121.35 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 813.97 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: 58.1 MB). Peak memory consumption was 58.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8484.22 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 130.0 MB). Free memory was 1.1 GB in the beginning and 870.3 MB in the end (delta: 180.6 MB). Peak memory consumption was 310.6 MB. Max. memory is 11.5 GB. * Witness Printer took 91.84 ms. Allocated memory is still 1.3 GB. Free memory is still 870.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 520]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L521] List a = (List) malloc(sizeof(struct node)); VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}] [L522] COND FALSE !(a == 0) VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}] [L523] List t; [L524] List p = a; VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L525] a->h = 2 VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L526] COND FALSE !(__VERIFIER_nondet_int()) [L533] p->h = 2 VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L534] p->n = 0 VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L535] p = a VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L536] COND TRUE p!=0 VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L537] EXPR p->h VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, p->h=2] [L537] COND FALSE !(p->h != 2) [L540] EXPR p->n VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, p->n={0:0}] [L540] p = p->n [L536] COND FALSE !(p!=0) VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={0:0}] [L542] return 0; VAL [\result=0, a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 69 locations, 18 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 8.3s, OverallIterations: 10, TraceHistogramMax: 2, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 241 SDtfs, 597 SDslu, 430 SDs, 0 SdLazy, 1062 SolverSat, 87 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=6, 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, 107 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 181 NumberOfCodeBlocks, 181 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 149 ConstructedInterpolants, 0 QuantifiedInterpolants, 14211 SizeOfPredicates, 12 NumberOfNonLiveVariables, 101 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 6/8 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 incorrect! Received shutdown request...