./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/forester-heap/dll-circular-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/forester-heap/dll-circular-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 95b20088216028e3d05e3cb41d4ed5c20af6a751 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:18:42,103 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:18:42,105 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:18:42,124 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:18:42,124 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:18:42,127 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:18:42,129 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:18:42,134 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:18:42,136 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:18:42,136 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:18:42,138 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:18:42,139 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:18:42,139 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:18:42,140 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:18:42,142 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:18:42,145 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:18:42,146 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:18:42,147 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:18:42,149 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:18:42,151 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:18:42,153 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:18:42,154 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:18:42,155 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:18:42,156 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:18:42,163 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:18:42,164 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:18:42,164 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:18:42,166 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:18:42,167 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:18:42,168 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:18:42,168 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:18:42,170 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:18:42,171 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:18:42,172 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:18:42,175 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:18:42,178 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:18:42,179 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:18:42,180 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:18:42,180 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:18:42,181 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:18:42,184 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:18:42,184 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:18:42,214 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:18:42,215 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:18:42,217 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:18:42,218 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:18:42,218 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:18:42,218 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:18:42,219 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 01:18:42,219 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:18:42,219 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:18:42,220 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 01:18:42,221 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:18:42,221 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-07-29 01:18:42,222 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-07-29 01:18:42,222 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-29 01:18:42,223 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-07-29 01:18:42,223 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 01:18:42,223 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:18:42,223 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:18:42,224 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:18:42,224 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-29 01:18:42,224 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-29 01:18:42,225 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 01:18:42,225 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:18:42,225 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-29 01:18:42,226 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:18:42,226 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-29 01:18:42,226 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:18:42,226 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 -> 95b20088216028e3d05e3cb41d4ed5c20af6a751 [2020-07-29 01:18:42,541 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:18:42,564 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:18:42,570 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:18:42,572 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:18:42,572 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:18:42,573 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-circular-1.i [2020-07-29 01:18:42,627 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/124f9e268/147a3de761b14cff81d5b4c26d2abd7a/FLAG0278417c1 [2020-07-29 01:18:43,200 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:18:43,201 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-1.i [2020-07-29 01:18:43,214 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/124f9e268/147a3de761b14cff81d5b4c26d2abd7a/FLAG0278417c1 [2020-07-29 01:18:43,479 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/124f9e268/147a3de761b14cff81d5b4c26d2abd7a [2020-07-29 01:18:43,482 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:18:43,485 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-07-29 01:18:43,486 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:18:43,487 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:18:43,490 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:18:43,492 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:18:43" (1/1) ... [2020-07-29 01:18:43,496 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ed5985d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:18:43, skipping insertion in model container [2020-07-29 01:18:43,496 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:18:43" (1/1) ... [2020-07-29 01:18:43,504 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:18:43,550 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:18:44,035 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:18:44,051 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:18:44,131 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:18:44,181 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:18:44,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:18:44 WrapperNode [2020-07-29 01:18:44,182 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:18:44,183 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:18:44,183 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:18:44,183 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:18:44,198 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:18:44" (1/1) ... [2020-07-29 01:18:44,198 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:18:44" (1/1) ... [2020-07-29 01:18:44,215 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:18:44" (1/1) ... [2020-07-29 01:18:44,215 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:18:44" (1/1) ... [2020-07-29 01:18:44,239 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:18:44" (1/1) ... [2020-07-29 01:18:44,247 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:18:44" (1/1) ... [2020-07-29 01:18:44,251 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:18:44" (1/1) ... [2020-07-29 01:18:44,257 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:18:44,258 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:18:44,258 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:18:44,258 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:18:44,259 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:18:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 01:18:44,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-29 01:18:44,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:18:44,337 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-29 01:18:44,338 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-29 01:18:44,338 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-29 01:18:44,338 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-29 01:18:44,338 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-29 01:18:44,339 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-29 01:18:44,339 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-29 01:18:44,339 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-29 01:18:44,339 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-29 01:18:44,340 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-29 01:18:44,340 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-29 01:18:44,340 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-29 01:18:44,340 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-29 01:18:44,340 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-29 01:18:44,341 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-29 01:18:44,341 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-29 01:18:44,341 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-29 01:18:44,341 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-29 01:18:44,342 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-29 01:18:44,342 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-29 01:18:44,342 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-29 01:18:44,342 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-29 01:18:44,343 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-29 01:18:44,343 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-29 01:18:44,343 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-29 01:18:44,343 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-29 01:18:44,343 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-29 01:18:44,344 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-29 01:18:44,344 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-29 01:18:44,344 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-29 01:18:44,344 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-29 01:18:44,345 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-29 01:18:44,345 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-29 01:18:44,345 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-29 01:18:44,345 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-29 01:18:44,345 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-29 01:18:44,346 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-29 01:18:44,346 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-29 01:18:44,346 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-29 01:18:44,346 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-29 01:18:44,346 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-29 01:18:44,347 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-29 01:18:44,347 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-29 01:18:44,347 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-29 01:18:44,347 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-29 01:18:44,347 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-29 01:18:44,348 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-29 01:18:44,348 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-29 01:18:44,348 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-29 01:18:44,348 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-29 01:18:44,349 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-29 01:18:44,349 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-29 01:18:44,349 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-29 01:18:44,349 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-29 01:18:44,349 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-29 01:18:44,350 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-29 01:18:44,350 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-29 01:18:44,350 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-29 01:18:44,350 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-29 01:18:44,351 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-29 01:18:44,351 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-29 01:18:44,351 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-29 01:18:44,351 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-29 01:18:44,351 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-29 01:18:44,352 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-29 01:18:44,352 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-29 01:18:44,352 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-29 01:18:44,352 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-29 01:18:44,352 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-29 01:18:44,353 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-29 01:18:44,353 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-29 01:18:44,353 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-29 01:18:44,353 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-29 01:18:44,354 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-29 01:18:44,354 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-29 01:18:44,354 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-29 01:18:44,354 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-29 01:18:44,354 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-29 01:18:44,355 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-29 01:18:44,355 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-29 01:18:44,355 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-29 01:18:44,355 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-29 01:18:44,355 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-29 01:18:44,356 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-29 01:18:44,356 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-29 01:18:44,356 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-29 01:18:44,356 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-29 01:18:44,357 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-29 01:18:44,357 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-29 01:18:44,357 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-29 01:18:44,357 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-29 01:18:44,357 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-29 01:18:44,357 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-29 01:18:44,358 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-29 01:18:44,358 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-29 01:18:44,358 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-29 01:18:44,358 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-29 01:18:44,358 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-29 01:18:44,359 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-29 01:18:44,359 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-29 01:18:44,359 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-29 01:18:44,359 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-29 01:18:44,360 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-29 01:18:44,360 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-29 01:18:44,360 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-29 01:18:44,360 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-29 01:18:44,361 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-29 01:18:44,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-29 01:18:44,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-29 01:18:44,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:18:44,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-29 01:18:44,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:18:44,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:18:44,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-29 01:18:44,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:18:45,284 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:18:45,285 INFO L295 CfgBuilder]: Removed 9 assume(true) statements. [2020-07-29 01:18:45,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:18:45 BoogieIcfgContainer [2020-07-29 01:18:45,290 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:18:45,292 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-29 01:18:45,292 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-29 01:18:45,296 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-29 01:18:45,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.07 01:18:43" (1/3) ... [2020-07-29 01:18:45,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@726ae238 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:18:45, skipping insertion in model container [2020-07-29 01:18:45,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:18:44" (2/3) ... [2020-07-29 01:18:45,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@726ae238 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:18:45, skipping insertion in model container [2020-07-29 01:18:45,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:18:45" (3/3) ... [2020-07-29 01:18:45,300 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-circular-1.i [2020-07-29 01:18:45,311 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-29 01:18:45,321 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 50 error locations. [2020-07-29 01:18:45,336 INFO L251 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2020-07-29 01:18:45,360 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-29 01:18:45,360 INFO L376 AbstractCegarLoop]: Hoare is false [2020-07-29 01:18:45,360 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-29 01:18:45,361 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:18:45,361 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:18:45,361 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-29 01:18:45,362 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:18:45,362 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-29 01:18:45,382 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2020-07-29 01:18:45,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-29 01:18:45,393 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:18:45,394 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:18:45,395 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:18:45,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:18:45,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1524629102, now seen corresponding path program 1 times [2020-07-29 01:18:45,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:18:45,413 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138918006] [2020-07-29 01:18:45,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:18:45,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:45,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:18:45,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:45,645 INFO L280 TraceCheckUtils]: 0: Hoare triple {122#(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; {116#true} is VALID [2020-07-29 01:18:45,646 INFO L280 TraceCheckUtils]: 1: Hoare triple {116#true} assume true; {116#true} is VALID [2020-07-29 01:18:45,647 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {116#true} {116#true} #204#return; {116#true} is VALID [2020-07-29 01:18:45,651 INFO L263 TraceCheckUtils]: 0: Hoare triple {116#true} call ULTIMATE.init(); {122#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:18:45,652 INFO L280 TraceCheckUtils]: 1: Hoare triple {122#(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; {116#true} is VALID [2020-07-29 01:18:45,652 INFO L280 TraceCheckUtils]: 2: Hoare triple {116#true} assume true; {116#true} is VALID [2020-07-29 01:18:45,653 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {116#true} {116#true} #204#return; {116#true} is VALID [2020-07-29 01:18:45,653 INFO L263 TraceCheckUtils]: 4: Hoare triple {116#true} call #t~ret18 := main(); {116#true} is VALID [2020-07-29 01:18:45,655 INFO L280 TraceCheckUtils]: 5: Hoare triple {116#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {121#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-29 01:18:45,657 INFO L280 TraceCheckUtils]: 6: Hoare triple {121#(= 1 (select |#valid| main_~head~0.base))} assume !(1 == #valid[~head~0.base]); {117#false} is VALID [2020-07-29 01:18:45,658 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:18:45,659 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138918006] [2020-07-29 01:18:45,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:18:45,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:18:45,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735741016] [2020-07-29 01:18:45,668 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-29 01:18:45,672 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:18:45,676 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:18:45,696 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:18:45,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:18:45,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:18:45,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:18:45,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:18:45,711 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 4 states. [2020-07-29 01:18:46,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:46,369 INFO L93 Difference]: Finished difference Result 119 states and 126 transitions. [2020-07-29 01:18:46,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:18:46,370 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-29 01:18:46,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:18:46,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:18:46,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions. [2020-07-29 01:18:46,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:18:46,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions. [2020-07-29 01:18:46,397 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 143 transitions. [2020-07-29 01:18:46,595 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:18:46,614 INFO L225 Difference]: With dead ends: 119 [2020-07-29 01:18:46,614 INFO L226 Difference]: Without dead ends: 116 [2020-07-29 01:18:46,617 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:18:46,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-07-29 01:18:46,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 106. [2020-07-29 01:18:46,661 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:18:46,662 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand 106 states. [2020-07-29 01:18:46,662 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand 106 states. [2020-07-29 01:18:46,663 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 106 states. [2020-07-29 01:18:46,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:46,675 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2020-07-29 01:18:46,675 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2020-07-29 01:18:46,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:46,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:46,678 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 116 states. [2020-07-29 01:18:46,678 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 116 states. [2020-07-29 01:18:46,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:46,689 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2020-07-29 01:18:46,690 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2020-07-29 01:18:46,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:46,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:46,692 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:18:46,692 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:18:46,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-07-29 01:18:46,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 112 transitions. [2020-07-29 01:18:46,701 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 112 transitions. Word has length 7 [2020-07-29 01:18:46,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:18:46,702 INFO L479 AbstractCegarLoop]: Abstraction has 106 states and 112 transitions. [2020-07-29 01:18:46,703 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:18:46,703 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 112 transitions. [2020-07-29 01:18:46,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-29 01:18:46,704 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:18:46,704 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:18:46,704 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-29 01:18:46,705 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:18:46,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:18:46,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1524629103, now seen corresponding path program 1 times [2020-07-29 01:18:46,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:18:46,707 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105759468] [2020-07-29 01:18:46,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:18:46,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:46,798 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:18:46,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:46,822 INFO L280 TraceCheckUtils]: 0: Hoare triple {588#(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; {582#true} is VALID [2020-07-29 01:18:46,822 INFO L280 TraceCheckUtils]: 1: Hoare triple {582#true} assume true; {582#true} is VALID [2020-07-29 01:18:46,822 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {582#true} {582#true} #204#return; {582#true} is VALID [2020-07-29 01:18:46,823 INFO L263 TraceCheckUtils]: 0: Hoare triple {582#true} call ULTIMATE.init(); {588#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:18:46,824 INFO L280 TraceCheckUtils]: 1: Hoare triple {588#(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; {582#true} is VALID [2020-07-29 01:18:46,825 INFO L280 TraceCheckUtils]: 2: Hoare triple {582#true} assume true; {582#true} is VALID [2020-07-29 01:18:46,825 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {582#true} {582#true} #204#return; {582#true} is VALID [2020-07-29 01:18:46,825 INFO L263 TraceCheckUtils]: 4: Hoare triple {582#true} call #t~ret18 := main(); {582#true} is VALID [2020-07-29 01:18:46,830 INFO L280 TraceCheckUtils]: 5: Hoare triple {582#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {587#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)))} is VALID [2020-07-29 01:18:46,832 INFO L280 TraceCheckUtils]: 6: Hoare triple {587#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)))} assume !(4 + ~head~0.offset <= #length[~head~0.base] && 0 <= ~head~0.offset); {583#false} is VALID [2020-07-29 01:18:46,832 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:18:46,833 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105759468] [2020-07-29 01:18:46,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:18:46,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:18:46,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68389960] [2020-07-29 01:18:46,835 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-29 01:18:46,836 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:18:46,836 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:18:46,846 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:18:46,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:18:46,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:18:46,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:18:46,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:18:46,848 INFO L87 Difference]: Start difference. First operand 106 states and 112 transitions. Second operand 4 states. [2020-07-29 01:18:47,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:47,455 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2020-07-29 01:18:47,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:18:47,456 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-29 01:18:47,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:18:47,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:18:47,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2020-07-29 01:18:47,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:18:47,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2020-07-29 01:18:47,467 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 124 transitions. [2020-07-29 01:18:47,649 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:18:47,655 INFO L225 Difference]: With dead ends: 114 [2020-07-29 01:18:47,656 INFO L226 Difference]: Without dead ends: 114 [2020-07-29 01:18:47,657 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:18:47,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-07-29 01:18:47,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 102. [2020-07-29 01:18:47,675 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:18:47,680 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand 102 states. [2020-07-29 01:18:47,681 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 102 states. [2020-07-29 01:18:47,681 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 102 states. [2020-07-29 01:18:47,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:47,697 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2020-07-29 01:18:47,698 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 120 transitions. [2020-07-29 01:18:47,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:47,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:47,703 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 114 states. [2020-07-29 01:18:47,703 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 114 states. [2020-07-29 01:18:47,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:47,715 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2020-07-29 01:18:47,716 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 120 transitions. [2020-07-29 01:18:47,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:47,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:47,721 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:18:47,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:18:47,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-07-29 01:18:47,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2020-07-29 01:18:47,732 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 7 [2020-07-29 01:18:47,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:18:47,732 INFO L479 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2020-07-29 01:18:47,732 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:18:47,733 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2020-07-29 01:18:47,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-29 01:18:47,734 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:18:47,734 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:18:47,734 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-29 01:18:47,740 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:18:47,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:18:47,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1043867395, now seen corresponding path program 1 times [2020-07-29 01:18:47,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:18:47,742 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438263168] [2020-07-29 01:18:47,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:18:47,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:47,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:18:47,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:47,828 INFO L280 TraceCheckUtils]: 0: Hoare triple {1042#(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; {1035#true} is VALID [2020-07-29 01:18:47,828 INFO L280 TraceCheckUtils]: 1: Hoare triple {1035#true} assume true; {1035#true} is VALID [2020-07-29 01:18:47,828 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1035#true} {1035#true} #204#return; {1035#true} is VALID [2020-07-29 01:18:47,830 INFO L263 TraceCheckUtils]: 0: Hoare triple {1035#true} call ULTIMATE.init(); {1042#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:18:47,830 INFO L280 TraceCheckUtils]: 1: Hoare triple {1042#(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; {1035#true} is VALID [2020-07-29 01:18:47,831 INFO L280 TraceCheckUtils]: 2: Hoare triple {1035#true} assume true; {1035#true} is VALID [2020-07-29 01:18:47,831 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1035#true} {1035#true} #204#return; {1035#true} is VALID [2020-07-29 01:18:47,831 INFO L263 TraceCheckUtils]: 4: Hoare triple {1035#true} call #t~ret18 := main(); {1035#true} is VALID [2020-07-29 01:18:47,832 INFO L280 TraceCheckUtils]: 5: Hoare triple {1035#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {1035#true} is VALID [2020-07-29 01:18:47,833 INFO L280 TraceCheckUtils]: 6: Hoare triple {1035#true} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset, 4); srcloc: L987 {1040#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-29 01:18:47,834 INFO L280 TraceCheckUtils]: 7: Hoare triple {1040#(= 1 (select |#valid| main_~head~0.base))} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L987-1 {1040#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-29 01:18:47,835 INFO L280 TraceCheckUtils]: 8: Hoare triple {1040#(= 1 (select |#valid| main_~head~0.base))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;~state~0 := 1; {1041#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-29 01:18:47,836 INFO L280 TraceCheckUtils]: 9: Hoare triple {1041#(= 1 (select |#valid| main_~x~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1041#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-29 01:18:47,837 INFO L280 TraceCheckUtils]: 10: Hoare triple {1041#(= 1 (select |#valid| main_~x~0.base))} assume !(0 != #t~nondet1);havoc #t~nondet1; {1041#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-29 01:18:47,837 INFO L280 TraceCheckUtils]: 11: Hoare triple {1041#(= 1 (select |#valid| main_~x~0.base))} assume !(1 == #valid[~x~0.base]); {1036#false} is VALID [2020-07-29 01:18:47,839 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:18:47,839 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438263168] [2020-07-29 01:18:47,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:18:47,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 01:18:47,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781341345] [2020-07-29 01:18:47,840 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-29 01:18:47,841 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:18:47,841 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:18:47,855 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:18:47,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-29 01:18:47,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:18:47,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:18:47,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:18:47,856 INFO L87 Difference]: Start difference. First operand 102 states and 108 transitions. Second operand 5 states. [2020-07-29 01:18:48,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:48,397 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2020-07-29 01:18:48,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:18:48,397 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-29 01:18:48,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:18:48,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:18:48,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 119 transitions. [2020-07-29 01:18:48,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:18:48,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 119 transitions. [2020-07-29 01:18:48,405 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 119 transitions. [2020-07-29 01:18:48,532 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:18:48,535 INFO L225 Difference]: With dead ends: 99 [2020-07-29 01:18:48,535 INFO L226 Difference]: Without dead ends: 99 [2020-07-29 01:18:48,535 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:18:48,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-07-29 01:18:48,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 90. [2020-07-29 01:18:48,541 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:18:48,542 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand 90 states. [2020-07-29 01:18:48,542 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 90 states. [2020-07-29 01:18:48,542 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 90 states. [2020-07-29 01:18:48,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:48,548 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2020-07-29 01:18:48,549 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2020-07-29 01:18:48,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:48,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:48,550 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 99 states. [2020-07-29 01:18:48,550 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 99 states. [2020-07-29 01:18:48,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:48,556 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2020-07-29 01:18:48,557 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2020-07-29 01:18:48,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:48,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:48,558 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:18:48,558 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:18:48,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-07-29 01:18:48,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2020-07-29 01:18:48,563 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 12 [2020-07-29 01:18:48,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:18:48,564 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2020-07-29 01:18:48,564 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-29 01:18:48,564 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2020-07-29 01:18:48,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-29 01:18:48,565 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:18:48,565 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:18:48,565 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-29 01:18:48,566 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:18:48,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:18:48,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1043867394, now seen corresponding path program 1 times [2020-07-29 01:18:48,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:18:48,567 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709170406] [2020-07-29 01:18:48,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:18:48,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:48,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:18:48,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:48,707 INFO L280 TraceCheckUtils]: 0: Hoare triple {1441#(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; {1434#true} is VALID [2020-07-29 01:18:48,707 INFO L280 TraceCheckUtils]: 1: Hoare triple {1434#true} assume true; {1434#true} is VALID [2020-07-29 01:18:48,707 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1434#true} {1434#true} #204#return; {1434#true} is VALID [2020-07-29 01:18:48,708 INFO L263 TraceCheckUtils]: 0: Hoare triple {1434#true} call ULTIMATE.init(); {1441#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:18:48,709 INFO L280 TraceCheckUtils]: 1: Hoare triple {1441#(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; {1434#true} is VALID [2020-07-29 01:18:48,709 INFO L280 TraceCheckUtils]: 2: Hoare triple {1434#true} assume true; {1434#true} is VALID [2020-07-29 01:18:48,709 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1434#true} {1434#true} #204#return; {1434#true} is VALID [2020-07-29 01:18:48,709 INFO L263 TraceCheckUtils]: 4: Hoare triple {1434#true} call #t~ret18 := main(); {1434#true} is VALID [2020-07-29 01:18:48,712 INFO L280 TraceCheckUtils]: 5: Hoare triple {1434#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {1439#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)))} is VALID [2020-07-29 01:18:48,713 INFO L280 TraceCheckUtils]: 6: Hoare triple {1439#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)))} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset, 4); srcloc: L987 {1439#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)))} is VALID [2020-07-29 01:18:48,714 INFO L280 TraceCheckUtils]: 7: Hoare triple {1439#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)))} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L987-1 {1439#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)))} is VALID [2020-07-29 01:18:48,714 INFO L280 TraceCheckUtils]: 8: Hoare triple {1439#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;~state~0 := 1; {1440#(and (= 12 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0))} is VALID [2020-07-29 01:18:48,715 INFO L280 TraceCheckUtils]: 9: Hoare triple {1440#(and (= 12 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1440#(and (= 12 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0))} is VALID [2020-07-29 01:18:48,716 INFO L280 TraceCheckUtils]: 10: Hoare triple {1440#(and (= 12 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0))} assume !(0 != #t~nondet1);havoc #t~nondet1; {1440#(and (= 12 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0))} is VALID [2020-07-29 01:18:48,717 INFO L280 TraceCheckUtils]: 11: Hoare triple {1440#(and (= 12 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0))} assume !(4 + (8 + ~x~0.offset) <= #length[~x~0.base] && 0 <= 8 + ~x~0.offset); {1435#false} is VALID [2020-07-29 01:18:48,718 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:18:48,718 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709170406] [2020-07-29 01:18:48,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:18:48,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 01:18:48,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395417754] [2020-07-29 01:18:48,719 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-29 01:18:48,720 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:18:48,720 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:18:48,737 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:18:48,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-29 01:18:48,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:18:48,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:18:48,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:18:48,738 INFO L87 Difference]: Start difference. First operand 90 states and 96 transitions. Second operand 5 states. [2020-07-29 01:18:49,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:49,373 INFO L93 Difference]: Finished difference Result 114 states and 121 transitions. [2020-07-29 01:18:49,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:18:49,374 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-29 01:18:49,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:18:49,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:18:49,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2020-07-29 01:18:49,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:18:49,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2020-07-29 01:18:49,380 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 125 transitions. [2020-07-29 01:18:49,545 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:18:49,548 INFO L225 Difference]: With dead ends: 114 [2020-07-29 01:18:49,548 INFO L226 Difference]: Without dead ends: 114 [2020-07-29 01:18:49,549 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:18:49,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-07-29 01:18:49,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 98. [2020-07-29 01:18:49,555 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:18:49,555 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand 98 states. [2020-07-29 01:18:49,555 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 98 states. [2020-07-29 01:18:49,556 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 98 states. [2020-07-29 01:18:49,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:49,560 INFO L93 Difference]: Finished difference Result 114 states and 121 transitions. [2020-07-29 01:18:49,560 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2020-07-29 01:18:49,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:49,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:49,561 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 114 states. [2020-07-29 01:18:49,562 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 114 states. [2020-07-29 01:18:49,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:49,566 INFO L93 Difference]: Finished difference Result 114 states and 121 transitions. [2020-07-29 01:18:49,566 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2020-07-29 01:18:49,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:49,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:49,567 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:18:49,567 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:18:49,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-07-29 01:18:49,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2020-07-29 01:18:49,571 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 12 [2020-07-29 01:18:49,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:18:49,572 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2020-07-29 01:18:49,572 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-29 01:18:49,572 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2020-07-29 01:18:49,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-29 01:18:49,573 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:18:49,573 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:18:49,573 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-29 01:18:49,573 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:18:49,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:18:49,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1865783331, now seen corresponding path program 1 times [2020-07-29 01:18:49,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:18:49,574 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927138002] [2020-07-29 01:18:49,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:18:49,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:49,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:18:49,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:49,666 INFO L280 TraceCheckUtils]: 0: Hoare triple {1894#(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; {1886#true} is VALID [2020-07-29 01:18:49,666 INFO L280 TraceCheckUtils]: 1: Hoare triple {1886#true} assume true; {1886#true} is VALID [2020-07-29 01:18:49,667 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1886#true} {1886#true} #204#return; {1886#true} is VALID [2020-07-29 01:18:49,669 INFO L263 TraceCheckUtils]: 0: Hoare triple {1886#true} call ULTIMATE.init(); {1894#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:18:49,669 INFO L280 TraceCheckUtils]: 1: Hoare triple {1894#(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; {1886#true} is VALID [2020-07-29 01:18:49,669 INFO L280 TraceCheckUtils]: 2: Hoare triple {1886#true} assume true; {1886#true} is VALID [2020-07-29 01:18:49,670 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1886#true} {1886#true} #204#return; {1886#true} is VALID [2020-07-29 01:18:49,670 INFO L263 TraceCheckUtils]: 4: Hoare triple {1886#true} call #t~ret18 := main(); {1886#true} is VALID [2020-07-29 01:18:49,670 INFO L280 TraceCheckUtils]: 5: Hoare triple {1886#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {1886#true} is VALID [2020-07-29 01:18:49,671 INFO L280 TraceCheckUtils]: 6: Hoare triple {1886#true} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset, 4); srcloc: L987 {1886#true} is VALID [2020-07-29 01:18:49,671 INFO L280 TraceCheckUtils]: 7: Hoare triple {1886#true} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L987-1 {1886#true} is VALID [2020-07-29 01:18:49,671 INFO L280 TraceCheckUtils]: 8: Hoare triple {1886#true} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;~state~0 := 1; {1886#true} is VALID [2020-07-29 01:18:49,671 INFO L280 TraceCheckUtils]: 9: Hoare triple {1886#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1886#true} is VALID [2020-07-29 01:18:49,673 INFO L280 TraceCheckUtils]: 10: Hoare triple {1886#true} assume !!(0 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12); {1891#(= (select |#valid| |main_#t~malloc2.base|) 1)} is VALID [2020-07-29 01:18:49,675 INFO L280 TraceCheckUtils]: 11: Hoare triple {1891#(= (select |#valid| |main_#t~malloc2.base|) 1)} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L997 {1892#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-29 01:18:49,677 INFO L280 TraceCheckUtils]: 12: Hoare triple {1892#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L997-1 {1893#(= 1 (select |#valid| |main_#t~mem3.base|))} is VALID [2020-07-29 01:18:49,678 INFO L280 TraceCheckUtils]: 13: Hoare triple {1893#(= 1 (select |#valid| |main_#t~mem3.base|))} assume !(1 == #valid[#t~mem3.base]); {1887#false} is VALID [2020-07-29 01:18:49,679 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:18:49,679 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927138002] [2020-07-29 01:18:49,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:18:49,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 01:18:49,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834658758] [2020-07-29 01:18:49,680 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-07-29 01:18:49,681 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:18:49,681 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:18:49,697 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:18:49,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-29 01:18:49,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:18:49,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:18:49,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:18:49,699 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand 6 states. [2020-07-29 01:18:50,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:50,782 INFO L93 Difference]: Finished difference Result 148 states and 159 transitions. [2020-07-29 01:18:50,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:18:50,783 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-07-29 01:18:50,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:18:50,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:18:50,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 154 transitions. [2020-07-29 01:18:50,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:18:50,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 154 transitions. [2020-07-29 01:18:50,790 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 154 transitions. [2020-07-29 01:18:50,963 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:18:50,968 INFO L225 Difference]: With dead ends: 148 [2020-07-29 01:18:50,968 INFO L226 Difference]: Without dead ends: 148 [2020-07-29 01:18:50,968 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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:18:50,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-07-29 01:18:50,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 97. [2020-07-29 01:18:50,979 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:18:50,979 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand 97 states. [2020-07-29 01:18:50,980 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand 97 states. [2020-07-29 01:18:50,980 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 97 states. [2020-07-29 01:18:50,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:50,986 INFO L93 Difference]: Finished difference Result 148 states and 159 transitions. [2020-07-29 01:18:50,986 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 159 transitions. [2020-07-29 01:18:50,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:50,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:50,987 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 148 states. [2020-07-29 01:18:50,987 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 148 states. [2020-07-29 01:18:50,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:50,992 INFO L93 Difference]: Finished difference Result 148 states and 159 transitions. [2020-07-29 01:18:50,993 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 159 transitions. [2020-07-29 01:18:50,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:50,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:50,994 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:18:50,994 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:18:50,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-07-29 01:18:50,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2020-07-29 01:18:50,997 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 14 [2020-07-29 01:18:50,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:18:50,998 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2020-07-29 01:18:50,998 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-29 01:18:50,998 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2020-07-29 01:18:50,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-29 01:18:50,998 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:18:50,999 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:18:50,999 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-29 01:18:50,999 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:18:51,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:18:51,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1865783332, now seen corresponding path program 1 times [2020-07-29 01:18:51,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:18:51,001 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583221608] [2020-07-29 01:18:51,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:18:51,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:51,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:18:51,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:51,130 INFO L280 TraceCheckUtils]: 0: Hoare triple {2450#(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; {2442#true} is VALID [2020-07-29 01:18:51,130 INFO L280 TraceCheckUtils]: 1: Hoare triple {2442#true} assume true; {2442#true} is VALID [2020-07-29 01:18:51,130 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2442#true} {2442#true} #204#return; {2442#true} is VALID [2020-07-29 01:18:51,131 INFO L263 TraceCheckUtils]: 0: Hoare triple {2442#true} call ULTIMATE.init(); {2450#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:18:51,132 INFO L280 TraceCheckUtils]: 1: Hoare triple {2450#(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; {2442#true} is VALID [2020-07-29 01:18:51,132 INFO L280 TraceCheckUtils]: 2: Hoare triple {2442#true} assume true; {2442#true} is VALID [2020-07-29 01:18:51,132 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2442#true} {2442#true} #204#return; {2442#true} is VALID [2020-07-29 01:18:51,132 INFO L263 TraceCheckUtils]: 4: Hoare triple {2442#true} call #t~ret18 := main(); {2442#true} is VALID [2020-07-29 01:18:51,133 INFO L280 TraceCheckUtils]: 5: Hoare triple {2442#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {2442#true} is VALID [2020-07-29 01:18:51,133 INFO L280 TraceCheckUtils]: 6: Hoare triple {2442#true} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset, 4); srcloc: L987 {2442#true} is VALID [2020-07-29 01:18:51,133 INFO L280 TraceCheckUtils]: 7: Hoare triple {2442#true} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L987-1 {2442#true} is VALID [2020-07-29 01:18:51,133 INFO L280 TraceCheckUtils]: 8: Hoare triple {2442#true} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;~state~0 := 1; {2442#true} is VALID [2020-07-29 01:18:51,133 INFO L280 TraceCheckUtils]: 9: Hoare triple {2442#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2442#true} is VALID [2020-07-29 01:18:51,135 INFO L280 TraceCheckUtils]: 10: Hoare triple {2442#true} assume !!(0 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12); {2447#(and (= 12 (select |#length| |main_#t~malloc2.base|)) (= 0 |main_#t~malloc2.offset|))} is VALID [2020-07-29 01:18:51,137 INFO L280 TraceCheckUtils]: 11: Hoare triple {2447#(and (= 12 (select |#length| |main_#t~malloc2.base|)) (= 0 |main_#t~malloc2.offset|))} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L997 {2448#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} is VALID [2020-07-29 01:18:51,138 INFO L280 TraceCheckUtils]: 12: Hoare triple {2448#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L997-1 {2449#(and (= 12 (select |#length| |main_#t~mem3.base|)) (= 0 |main_#t~mem3.offset|))} is VALID [2020-07-29 01:18:51,140 INFO L280 TraceCheckUtils]: 13: Hoare triple {2449#(and (= 12 (select |#length| |main_#t~mem3.base|)) (= 0 |main_#t~mem3.offset|))} assume !(4 + (4 + #t~mem3.offset) <= #length[#t~mem3.base] && 0 <= 4 + #t~mem3.offset); {2443#false} is VALID [2020-07-29 01:18:51,140 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:18:51,141 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583221608] [2020-07-29 01:18:51,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:18:51,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 01:18:51,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403902801] [2020-07-29 01:18:51,142 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-07-29 01:18:51,142 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:18:51,142 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:18:51,163 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:18:51,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-29 01:18:51,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:18:51,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:18:51,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:18:51,165 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand 6 states. [2020-07-29 01:18:52,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:52,296 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions. [2020-07-29 01:18:52,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 01:18:52,296 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-07-29 01:18:52,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:18:52,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:18:52,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 154 transitions. [2020-07-29 01:18:52,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:18:52,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 154 transitions. [2020-07-29 01:18:52,304 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 154 transitions. [2020-07-29 01:18:52,480 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:18:52,484 INFO L225 Difference]: With dead ends: 149 [2020-07-29 01:18:52,484 INFO L226 Difference]: Without dead ends: 149 [2020-07-29 01:18:52,485 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:18:52,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2020-07-29 01:18:52,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 96. [2020-07-29 01:18:52,490 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:18:52,490 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand 96 states. [2020-07-29 01:18:52,491 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand 96 states. [2020-07-29 01:18:52,491 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 96 states. [2020-07-29 01:18:52,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:52,496 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions. [2020-07-29 01:18:52,496 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 158 transitions. [2020-07-29 01:18:52,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:52,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:52,497 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 149 states. [2020-07-29 01:18:52,497 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 149 states. [2020-07-29 01:18:52,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:52,502 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions. [2020-07-29 01:18:52,503 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 158 transitions. [2020-07-29 01:18:52,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:52,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:52,504 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:18:52,504 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:18:52,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-07-29 01:18:52,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2020-07-29 01:18:52,507 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 14 [2020-07-29 01:18:52,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:18:52,508 INFO L479 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2020-07-29 01:18:52,508 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-29 01:18:52,508 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2020-07-29 01:18:52,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-29 01:18:52,509 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:18:52,509 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:18:52,509 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-29 01:18:52,509 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:18:52,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:18:52,510 INFO L82 PathProgramCache]: Analyzing trace with hash 2015464416, now seen corresponding path program 1 times [2020-07-29 01:18:52,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:18:52,510 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011396373] [2020-07-29 01:18:52,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:18:52,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:52,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:18:52,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:52,719 INFO L280 TraceCheckUtils]: 0: Hoare triple {3013#(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; {3002#true} is VALID [2020-07-29 01:18:52,719 INFO L280 TraceCheckUtils]: 1: Hoare triple {3002#true} assume true; {3002#true} is VALID [2020-07-29 01:18:52,720 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3002#true} {3002#true} #204#return; {3002#true} is VALID [2020-07-29 01:18:52,721 INFO L263 TraceCheckUtils]: 0: Hoare triple {3002#true} call ULTIMATE.init(); {3013#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:18:52,721 INFO L280 TraceCheckUtils]: 1: Hoare triple {3013#(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; {3002#true} is VALID [2020-07-29 01:18:52,721 INFO L280 TraceCheckUtils]: 2: Hoare triple {3002#true} assume true; {3002#true} is VALID [2020-07-29 01:18:52,722 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3002#true} {3002#true} #204#return; {3002#true} is VALID [2020-07-29 01:18:52,722 INFO L263 TraceCheckUtils]: 4: Hoare triple {3002#true} call #t~ret18 := main(); {3002#true} is VALID [2020-07-29 01:18:52,723 INFO L280 TraceCheckUtils]: 5: Hoare triple {3002#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {3007#(and (not (= 0 main_~head~0.base)) (= 0 main_~head~0.offset))} is VALID [2020-07-29 01:18:52,724 INFO L280 TraceCheckUtils]: 6: Hoare triple {3007#(and (not (= 0 main_~head~0.base)) (= 0 main_~head~0.offset))} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset, 4); srcloc: L987 {3008#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 main_~head~0.offset))} is VALID [2020-07-29 01:18:52,725 INFO L280 TraceCheckUtils]: 7: Hoare triple {3008#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 main_~head~0.offset))} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L987-1 {3008#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 main_~head~0.offset))} is VALID [2020-07-29 01:18:52,726 INFO L280 TraceCheckUtils]: 8: Hoare triple {3008#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 main_~head~0.offset))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;~state~0 := 1; {3009#(and (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))))} is VALID [2020-07-29 01:18:52,727 INFO L280 TraceCheckUtils]: 9: Hoare triple {3009#(and (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {3009#(and (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))))} is VALID [2020-07-29 01:18:52,728 INFO L280 TraceCheckUtils]: 10: Hoare triple {3009#(and (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))))} assume !(0 != #t~nondet1);havoc #t~nondet1; {3009#(and (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))))} is VALID [2020-07-29 01:18:52,729 INFO L280 TraceCheckUtils]: 11: Hoare triple {3009#(and (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))))} SUMMARY for call write~int(~state~0, ~x~0.base, 8 + ~x~0.offset, 4); srcloc: L994-3 {3010#(not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))} is VALID [2020-07-29 01:18:52,730 INFO L280 TraceCheckUtils]: 12: Hoare triple {3010#(not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); srcloc: L1016 {3011#(not (= 0 |main_#t~mem6.base|))} is VALID [2020-07-29 01:18:52,731 INFO L280 TraceCheckUtils]: 13: Hoare triple {3011#(not (= 0 |main_#t~mem6.base|))} ~x~0.base, ~x~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {3012#(not (= 0 main_~x~0.base))} is VALID [2020-07-29 01:18:52,732 INFO L280 TraceCheckUtils]: 14: Hoare triple {3012#(not (= 0 main_~x~0.base))} assume !(0 != ~x~0.base || 0 != ~x~0.offset); {3003#false} is VALID [2020-07-29 01:18:52,732 INFO L280 TraceCheckUtils]: 15: Hoare triple {3003#false} assume !false; {3003#false} is VALID [2020-07-29 01:18:52,733 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:18:52,733 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011396373] [2020-07-29 01:18:52,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:18:52,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-29 01:18:52,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997306849] [2020-07-29 01:18:52,734 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2020-07-29 01:18:52,734 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:18:52,734 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 01:18:52,757 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:18:52,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-29 01:18:52,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:18:52,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-29 01:18:52,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:18:52,759 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand 9 states. [2020-07-29 01:18:54,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:54,035 INFO L93 Difference]: Finished difference Result 179 states and 190 transitions. [2020-07-29 01:18:54,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-29 01:18:54,036 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2020-07-29 01:18:54,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:18:54,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 01:18:54,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 191 transitions. [2020-07-29 01:18:54,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 01:18:54,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 191 transitions. [2020-07-29 01:18:54,042 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 191 transitions. [2020-07-29 01:18:54,280 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:18:54,287 INFO L225 Difference]: With dead ends: 179 [2020-07-29 01:18:54,288 INFO L226 Difference]: Without dead ends: 179 [2020-07-29 01:18:54,289 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2020-07-29 01:18:54,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2020-07-29 01:18:54,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 99. [2020-07-29 01:18:54,313 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:18:54,313 INFO L82 GeneralOperation]: Start isEquivalent. First operand 179 states. Second operand 99 states. [2020-07-29 01:18:54,313 INFO L74 IsIncluded]: Start isIncluded. First operand 179 states. Second operand 99 states. [2020-07-29 01:18:54,314 INFO L87 Difference]: Start difference. First operand 179 states. Second operand 99 states. [2020-07-29 01:18:54,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:54,327 INFO L93 Difference]: Finished difference Result 179 states and 190 transitions. [2020-07-29 01:18:54,328 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 190 transitions. [2020-07-29 01:18:54,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:54,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:54,330 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 179 states. [2020-07-29 01:18:54,330 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 179 states. [2020-07-29 01:18:54,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:54,339 INFO L93 Difference]: Finished difference Result 179 states and 190 transitions. [2020-07-29 01:18:54,340 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 190 transitions. [2020-07-29 01:18:54,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:54,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:54,341 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:18:54,341 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:18:54,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-07-29 01:18:54,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2020-07-29 01:18:54,346 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 16 [2020-07-29 01:18:54,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:18:54,347 INFO L479 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2020-07-29 01:18:54,347 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-29 01:18:54,347 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2020-07-29 01:18:54,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-29 01:18:54,348 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:18:54,348 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:18:54,349 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-29 01:18:54,349 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:18:54,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:18:54,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1945108375, now seen corresponding path program 1 times [2020-07-29 01:18:54,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:18:54,351 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122597000] [2020-07-29 01:18:54,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:18:54,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:54,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:18:54,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:54,658 INFO L280 TraceCheckUtils]: 0: Hoare triple {3673#(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; {3662#true} is VALID [2020-07-29 01:18:54,658 INFO L280 TraceCheckUtils]: 1: Hoare triple {3662#true} assume true; {3662#true} is VALID [2020-07-29 01:18:54,659 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3662#true} {3662#true} #204#return; {3662#true} is VALID [2020-07-29 01:18:54,661 INFO L263 TraceCheckUtils]: 0: Hoare triple {3662#true} call ULTIMATE.init(); {3673#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:18:54,661 INFO L280 TraceCheckUtils]: 1: Hoare triple {3673#(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; {3662#true} is VALID [2020-07-29 01:18:54,662 INFO L280 TraceCheckUtils]: 2: Hoare triple {3662#true} assume true; {3662#true} is VALID [2020-07-29 01:18:54,662 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3662#true} {3662#true} #204#return; {3662#true} is VALID [2020-07-29 01:18:54,662 INFO L263 TraceCheckUtils]: 4: Hoare triple {3662#true} call #t~ret18 := main(); {3662#true} is VALID [2020-07-29 01:18:54,664 INFO L280 TraceCheckUtils]: 5: Hoare triple {3662#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {3667#(= 0 main_~head~0.offset)} is VALID [2020-07-29 01:18:54,666 INFO L280 TraceCheckUtils]: 6: Hoare triple {3667#(= 0 main_~head~0.offset)} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset, 4); srcloc: L987 {3668#(and (= 1 (select |#valid| main_~head~0.base)) (= 0 main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base))} is VALID [2020-07-29 01:18:54,668 INFO L280 TraceCheckUtils]: 7: Hoare triple {3668#(and (= 1 (select |#valid| main_~head~0.base)) (= 0 main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base))} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L987-1 {3668#(and (= 1 (select |#valid| main_~head~0.base)) (= 0 main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base))} is VALID [2020-07-29 01:18:54,670 INFO L280 TraceCheckUtils]: 8: Hoare triple {3668#(and (= 1 (select |#valid| main_~head~0.base)) (= 0 main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;~state~0 := 1; {3669#(and (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) main_~head~0.base))} is VALID [2020-07-29 01:18:54,672 INFO L280 TraceCheckUtils]: 9: Hoare triple {3669#(and (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) main_~head~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {3669#(and (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) main_~head~0.base))} is VALID [2020-07-29 01:18:54,674 INFO L280 TraceCheckUtils]: 10: Hoare triple {3669#(and (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) main_~head~0.base))} assume !(0 != #t~nondet1);havoc #t~nondet1; {3669#(and (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) main_~head~0.base))} is VALID [2020-07-29 01:18:54,676 INFO L280 TraceCheckUtils]: 11: Hoare triple {3669#(and (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) main_~head~0.base))} SUMMARY for call write~int(~state~0, ~x~0.base, 8 + ~x~0.offset, 4); srcloc: L994-3 {3670#(and (= 1 (select |#valid| main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base))} is VALID [2020-07-29 01:18:54,677 INFO L280 TraceCheckUtils]: 12: Hoare triple {3670#(and (= 1 (select |#valid| main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base))} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); srcloc: L1016 {3671#(= 1 (select |#valid| |main_#t~mem6.base|))} is VALID [2020-07-29 01:18:54,679 INFO L280 TraceCheckUtils]: 13: Hoare triple {3671#(= 1 (select |#valid| |main_#t~mem6.base|))} ~x~0.base, ~x~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {3672#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-29 01:18:54,699 INFO L280 TraceCheckUtils]: 14: Hoare triple {3672#(= 1 (select |#valid| main_~x~0.base))} assume !!(0 != ~x~0.base || 0 != ~x~0.offset); {3672#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-29 01:18:54,700 INFO L280 TraceCheckUtils]: 15: Hoare triple {3672#(= 1 (select |#valid| main_~x~0.base))} goto; {3672#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-29 01:18:54,701 INFO L280 TraceCheckUtils]: 16: Hoare triple {3672#(= 1 (select |#valid| main_~x~0.base))} assume !(1 == #valid[~x~0.base]); {3663#false} is VALID [2020-07-29 01:18:54,704 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:18:54,704 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122597000] [2020-07-29 01:18:54,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:18:54,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-29 01:18:54,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574361007] [2020-07-29 01:18:54,705 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2020-07-29 01:18:54,708 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:18:54,709 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 01:18:54,737 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:18:54,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-29 01:18:54,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:18:54,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-29 01:18:54,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:18:54,739 INFO L87 Difference]: Start difference. First operand 99 states and 106 transitions. Second operand 9 states. [2020-07-29 01:18:56,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:56,016 INFO L93 Difference]: Finished difference Result 139 states and 149 transitions. [2020-07-29 01:18:56,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-29 01:18:56,016 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2020-07-29 01:18:56,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:18:56,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 01:18:56,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 146 transitions. [2020-07-29 01:18:56,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 01:18:56,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 146 transitions. [2020-07-29 01:18:56,027 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 146 transitions. [2020-07-29 01:18:56,194 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:18:56,197 INFO L225 Difference]: With dead ends: 139 [2020-07-29 01:18:56,197 INFO L226 Difference]: Without dead ends: 139 [2020-07-29 01:18:56,197 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2020-07-29 01:18:56,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-07-29 01:18:56,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 101. [2020-07-29 01:18:56,207 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:18:56,207 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand 101 states. [2020-07-29 01:18:56,207 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand 101 states. [2020-07-29 01:18:56,209 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 101 states. [2020-07-29 01:18:56,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:56,215 INFO L93 Difference]: Finished difference Result 139 states and 149 transitions. [2020-07-29 01:18:56,215 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 149 transitions. [2020-07-29 01:18:56,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:56,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:56,219 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 139 states. [2020-07-29 01:18:56,219 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 139 states. [2020-07-29 01:18:56,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:56,224 INFO L93 Difference]: Finished difference Result 139 states and 149 transitions. [2020-07-29 01:18:56,224 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 149 transitions. [2020-07-29 01:18:56,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:56,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:56,225 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:18:56,226 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:18:56,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-07-29 01:18:56,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2020-07-29 01:18:56,246 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 17 [2020-07-29 01:18:56,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:18:56,246 INFO L479 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2020-07-29 01:18:56,246 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-29 01:18:56,248 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2020-07-29 01:18:56,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-29 01:18:56,249 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:18:56,249 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:18:56,250 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-29 01:18:56,250 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:18:56,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:18:56,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1945108374, now seen corresponding path program 1 times [2020-07-29 01:18:56,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:18:56,252 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063193972] [2020-07-29 01:18:56,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:18:56,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:56,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:18:56,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:56,472 INFO L280 TraceCheckUtils]: 0: Hoare triple {4213#(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; {4202#true} is VALID [2020-07-29 01:18:56,472 INFO L280 TraceCheckUtils]: 1: Hoare triple {4202#true} assume true; {4202#true} is VALID [2020-07-29 01:18:56,473 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4202#true} {4202#true} #204#return; {4202#true} is VALID [2020-07-29 01:18:56,474 INFO L263 TraceCheckUtils]: 0: Hoare triple {4202#true} call ULTIMATE.init(); {4213#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:18:56,474 INFO L280 TraceCheckUtils]: 1: Hoare triple {4213#(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; {4202#true} is VALID [2020-07-29 01:18:56,474 INFO L280 TraceCheckUtils]: 2: Hoare triple {4202#true} assume true; {4202#true} is VALID [2020-07-29 01:18:56,475 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4202#true} {4202#true} #204#return; {4202#true} is VALID [2020-07-29 01:18:56,475 INFO L263 TraceCheckUtils]: 4: Hoare triple {4202#true} call #t~ret18 := main(); {4202#true} is VALID [2020-07-29 01:18:56,476 INFO L280 TraceCheckUtils]: 5: Hoare triple {4202#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {4207#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)))} is VALID [2020-07-29 01:18:56,478 INFO L280 TraceCheckUtils]: 6: Hoare triple {4207#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)))} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset, 4); srcloc: L987 {4208#(and (= (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 12) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 0 main_~head~0.offset))} is VALID [2020-07-29 01:18:56,480 INFO L280 TraceCheckUtils]: 7: Hoare triple {4208#(and (= (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 12) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 0 main_~head~0.offset))} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L987-1 {4208#(and (= (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 12) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 0 main_~head~0.offset))} is VALID [2020-07-29 01:18:56,481 INFO L280 TraceCheckUtils]: 8: Hoare triple {4208#(and (= (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 12) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 0 main_~head~0.offset))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;~state~0 := 1; {4209#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)))} is VALID [2020-07-29 01:18:56,482 INFO L280 TraceCheckUtils]: 9: Hoare triple {4209#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {4209#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)))} is VALID [2020-07-29 01:18:56,483 INFO L280 TraceCheckUtils]: 10: Hoare triple {4209#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)))} assume !(0 != #t~nondet1);havoc #t~nondet1; {4209#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)))} is VALID [2020-07-29 01:18:56,485 INFO L280 TraceCheckUtils]: 11: Hoare triple {4209#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)))} SUMMARY for call write~int(~state~0, ~x~0.base, 8 + ~x~0.offset, 4); srcloc: L994-3 {4210#(and (= (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 12) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))} is VALID [2020-07-29 01:18:56,486 INFO L280 TraceCheckUtils]: 12: Hoare triple {4210#(and (= (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 12) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); srcloc: L1016 {4211#(and (= 0 |main_#t~mem6.offset|) (= 12 (select |#length| |main_#t~mem6.base|)))} is VALID [2020-07-29 01:18:56,487 INFO L280 TraceCheckUtils]: 13: Hoare triple {4211#(and (= 0 |main_#t~mem6.offset|) (= 12 (select |#length| |main_#t~mem6.base|)))} ~x~0.base, ~x~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {4212#(and (= 12 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0))} is VALID [2020-07-29 01:18:56,488 INFO L280 TraceCheckUtils]: 14: Hoare triple {4212#(and (= 12 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0))} assume !!(0 != ~x~0.base || 0 != ~x~0.offset); {4212#(and (= 12 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0))} is VALID [2020-07-29 01:18:56,488 INFO L280 TraceCheckUtils]: 15: Hoare triple {4212#(and (= 12 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0))} goto; {4212#(and (= 12 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0))} is VALID [2020-07-29 01:18:56,489 INFO L280 TraceCheckUtils]: 16: Hoare triple {4212#(and (= 12 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0))} assume !(4 + (8 + ~x~0.offset) <= #length[~x~0.base] && 0 <= 8 + ~x~0.offset); {4203#false} is VALID [2020-07-29 01:18:56,491 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:18:56,491 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063193972] [2020-07-29 01:18:56,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:18:56,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-29 01:18:56,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082011857] [2020-07-29 01:18:56,492 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2020-07-29 01:18:56,493 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:18:56,493 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 01:18:56,515 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:18:56,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-29 01:18:56,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:18:56,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-29 01:18:56,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:18:56,517 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand 9 states. [2020-07-29 01:18:58,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:58,125 INFO L93 Difference]: Finished difference Result 173 states and 184 transitions. [2020-07-29 01:18:58,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-29 01:18:58,125 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2020-07-29 01:18:58,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:18:58,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 01:18:58,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 189 transitions. [2020-07-29 01:18:58,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 01:18:58,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 189 transitions. [2020-07-29 01:18:58,131 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 189 transitions. [2020-07-29 01:18:58,388 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:18:58,393 INFO L225 Difference]: With dead ends: 173 [2020-07-29 01:18:58,393 INFO L226 Difference]: Without dead ends: 173 [2020-07-29 01:18:58,394 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2020-07-29 01:18:58,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2020-07-29 01:18:58,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 113. [2020-07-29 01:18:58,399 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:18:58,399 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand 113 states. [2020-07-29 01:18:58,399 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand 113 states. [2020-07-29 01:18:58,400 INFO L87 Difference]: Start difference. First operand 173 states. Second operand 113 states. [2020-07-29 01:18:58,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:58,407 INFO L93 Difference]: Finished difference Result 173 states and 184 transitions. [2020-07-29 01:18:58,407 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 184 transitions. [2020-07-29 01:18:58,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:58,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:58,409 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 173 states. [2020-07-29 01:18:58,409 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 173 states. [2020-07-29 01:18:58,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:58,414 INFO L93 Difference]: Finished difference Result 173 states and 184 transitions. [2020-07-29 01:18:58,414 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 184 transitions. [2020-07-29 01:18:58,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:58,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:58,415 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:18:58,415 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:18:58,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-07-29 01:18:58,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 127 transitions. [2020-07-29 01:18:58,419 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 127 transitions. Word has length 17 [2020-07-29 01:18:58,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:18:58,419 INFO L479 AbstractCegarLoop]: Abstraction has 113 states and 127 transitions. [2020-07-29 01:18:58,419 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-29 01:18:58,420 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2020-07-29 01:18:58,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-29 01:18:58,420 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:18:58,421 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:18:58,421 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-29 01:18:58,421 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:18:58,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:18:58,422 INFO L82 PathProgramCache]: Analyzing trace with hash 748051109, now seen corresponding path program 1 times [2020-07-29 01:18:58,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:18:58,428 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486230426] [2020-07-29 01:18:58,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:18:58,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:58,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:18:58,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:58,616 INFO L280 TraceCheckUtils]: 0: Hoare triple {4870#(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; {4858#true} is VALID [2020-07-29 01:18:58,617 INFO L280 TraceCheckUtils]: 1: Hoare triple {4858#true} assume true; {4858#true} is VALID [2020-07-29 01:18:58,617 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4858#true} {4858#true} #204#return; {4858#true} is VALID [2020-07-29 01:18:58,618 INFO L263 TraceCheckUtils]: 0: Hoare triple {4858#true} call ULTIMATE.init(); {4870#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:18:58,618 INFO L280 TraceCheckUtils]: 1: Hoare triple {4870#(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; {4858#true} is VALID [2020-07-29 01:18:58,618 INFO L280 TraceCheckUtils]: 2: Hoare triple {4858#true} assume true; {4858#true} is VALID [2020-07-29 01:18:58,618 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4858#true} {4858#true} #204#return; {4858#true} is VALID [2020-07-29 01:18:58,619 INFO L263 TraceCheckUtils]: 4: Hoare triple {4858#true} call #t~ret18 := main(); {4858#true} is VALID [2020-07-29 01:18:58,619 INFO L280 TraceCheckUtils]: 5: Hoare triple {4858#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {4858#true} is VALID [2020-07-29 01:18:58,620 INFO L280 TraceCheckUtils]: 6: Hoare triple {4858#true} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset, 4); srcloc: L987 {4863#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-29 01:18:58,620 INFO L280 TraceCheckUtils]: 7: Hoare triple {4863#(= 1 (select |#valid| main_~head~0.base))} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L987-1 {4863#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-29 01:18:58,621 INFO L280 TraceCheckUtils]: 8: Hoare triple {4863#(= 1 (select |#valid| main_~head~0.base))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;~state~0 := 1; {4864#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-29 01:18:58,622 INFO L280 TraceCheckUtils]: 9: Hoare triple {4864#(= 1 (select |#valid| main_~x~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {4864#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-29 01:18:58,623 INFO L280 TraceCheckUtils]: 10: Hoare triple {4864#(= 1 (select |#valid| main_~x~0.base))} assume !!(0 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12); {4865#(and (= (select |#valid| |main_#t~malloc2.base|) 1) (not (= |main_#t~malloc2.base| main_~x~0.base)))} is VALID [2020-07-29 01:18:58,624 INFO L280 TraceCheckUtils]: 11: Hoare triple {4865#(and (= (select |#valid| |main_#t~malloc2.base|) 1) (not (= |main_#t~malloc2.base| main_~x~0.base)))} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L997 {4866#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))} is VALID [2020-07-29 01:18:58,626 INFO L280 TraceCheckUtils]: 12: Hoare triple {4866#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L997-1 {4867#(and (not (= |main_#t~mem3.base| main_~x~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} is VALID [2020-07-29 01:18:58,627 INFO L280 TraceCheckUtils]: 13: Hoare triple {4867#(and (not (= |main_#t~mem3.base| main_~x~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} SUMMARY for call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem3.base, 4 + #t~mem3.offset, 4); srcloc: L998 {4868#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-29 01:18:58,628 INFO L280 TraceCheckUtils]: 14: Hoare triple {4868#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} havoc #t~mem3.base, #t~mem3.offset; {4868#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-29 01:18:58,629 INFO L280 TraceCheckUtils]: 15: Hoare triple {4868#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} SUMMARY for call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L999 {4869#(= 1 (select |#valid| |main_#t~mem4.base|))} is VALID [2020-07-29 01:18:58,630 INFO L280 TraceCheckUtils]: 16: Hoare triple {4869#(= 1 (select |#valid| |main_#t~mem4.base|))} ~x~0.base, ~x~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset; {4864#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-29 01:18:58,631 INFO L280 TraceCheckUtils]: 17: Hoare triple {4864#(= 1 (select |#valid| main_~x~0.base))} assume !(1 == #valid[~x~0.base]); {4859#false} is VALID [2020-07-29 01:18:58,633 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:18:58,633 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486230426] [2020-07-29 01:18:58,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:18:58,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-29 01:18:58,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311775180] [2020-07-29 01:18:58,635 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2020-07-29 01:18:58,635 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:18:58,635 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-29 01:18:58,658 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:18:58,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-29 01:18:58,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:18:58,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-29 01:18:58,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:18:58,659 INFO L87 Difference]: Start difference. First operand 113 states and 127 transitions. Second operand 10 states. [2020-07-29 01:19:00,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:00,127 INFO L93 Difference]: Finished difference Result 121 states and 136 transitions. [2020-07-29 01:19:00,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-29 01:19:00,128 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2020-07-29 01:19:00,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:00,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:19:00,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 111 transitions. [2020-07-29 01:19:00,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:19:00,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 111 transitions. [2020-07-29 01:19:00,132 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 111 transitions. [2020-07-29 01:19:00,301 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:00,304 INFO L225 Difference]: With dead ends: 121 [2020-07-29 01:19:00,304 INFO L226 Difference]: Without dead ends: 121 [2020-07-29 01:19:00,305 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2020-07-29 01:19:00,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-07-29 01:19:00,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 112. [2020-07-29 01:19:00,308 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:00,308 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand 112 states. [2020-07-29 01:19:00,308 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 112 states. [2020-07-29 01:19:00,309 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 112 states. [2020-07-29 01:19:00,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:00,312 INFO L93 Difference]: Finished difference Result 121 states and 136 transitions. [2020-07-29 01:19:00,312 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 136 transitions. [2020-07-29 01:19:00,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:00,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:00,313 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 121 states. [2020-07-29 01:19:00,313 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 121 states. [2020-07-29 01:19:00,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:00,316 INFO L93 Difference]: Finished difference Result 121 states and 136 transitions. [2020-07-29 01:19:00,316 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 136 transitions. [2020-07-29 01:19:00,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:00,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:00,317 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:00,317 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:00,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-07-29 01:19:00,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 126 transitions. [2020-07-29 01:19:00,320 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 126 transitions. Word has length 18 [2020-07-29 01:19:00,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:00,321 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 126 transitions. [2020-07-29 01:19:00,321 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-29 01:19:00,321 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 126 transitions. [2020-07-29 01:19:00,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-29 01:19:00,321 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:00,322 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:00,322 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-29 01:19:00,322 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:19:00,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:00,323 INFO L82 PathProgramCache]: Analyzing trace with hash 748051110, now seen corresponding path program 1 times [2020-07-29 01:19:00,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:00,323 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713876989] [2020-07-29 01:19:00,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:00,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:00,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:00,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:00,581 INFO L280 TraceCheckUtils]: 0: Hoare triple {5375#(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; {5362#true} is VALID [2020-07-29 01:19:00,582 INFO L280 TraceCheckUtils]: 1: Hoare triple {5362#true} assume true; {5362#true} is VALID [2020-07-29 01:19:00,582 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5362#true} {5362#true} #204#return; {5362#true} is VALID [2020-07-29 01:19:00,583 INFO L263 TraceCheckUtils]: 0: Hoare triple {5362#true} call ULTIMATE.init(); {5375#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:00,583 INFO L280 TraceCheckUtils]: 1: Hoare triple {5375#(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; {5362#true} is VALID [2020-07-29 01:19:00,584 INFO L280 TraceCheckUtils]: 2: Hoare triple {5362#true} assume true; {5362#true} is VALID [2020-07-29 01:19:00,584 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5362#true} {5362#true} #204#return; {5362#true} is VALID [2020-07-29 01:19:00,584 INFO L263 TraceCheckUtils]: 4: Hoare triple {5362#true} call #t~ret18 := main(); {5362#true} is VALID [2020-07-29 01:19:00,585 INFO L280 TraceCheckUtils]: 5: Hoare triple {5362#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {5362#true} is VALID [2020-07-29 01:19:00,585 INFO L280 TraceCheckUtils]: 6: Hoare triple {5362#true} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset, 4); srcloc: L987 {5367#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-29 01:19:00,586 INFO L280 TraceCheckUtils]: 7: Hoare triple {5367#(= 1 (select |#valid| main_~head~0.base))} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L987-1 {5367#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-29 01:19:00,587 INFO L280 TraceCheckUtils]: 8: Hoare triple {5367#(= 1 (select |#valid| main_~head~0.base))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;~state~0 := 1; {5368#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-29 01:19:00,587 INFO L280 TraceCheckUtils]: 9: Hoare triple {5368#(= 1 (select |#valid| main_~x~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {5368#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-29 01:19:00,589 INFO L280 TraceCheckUtils]: 10: Hoare triple {5368#(= 1 (select |#valid| main_~x~0.base))} assume !!(0 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12); {5369#(and (= 12 (select |#length| |main_#t~malloc2.base|)) (= 0 |main_#t~malloc2.offset|) (not (= |main_#t~malloc2.base| main_~x~0.base)))} is VALID [2020-07-29 01:19:00,590 INFO L280 TraceCheckUtils]: 11: Hoare triple {5369#(and (= 12 (select |#length| |main_#t~malloc2.base|)) (= 0 |main_#t~malloc2.offset|) (not (= |main_#t~malloc2.base| main_~x~0.base)))} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L997 {5370#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} is VALID [2020-07-29 01:19:00,591 INFO L280 TraceCheckUtils]: 12: Hoare triple {5370#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L997-1 {5371#(and (not (= |main_#t~mem3.base| main_~x~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} is VALID [2020-07-29 01:19:00,593 INFO L280 TraceCheckUtils]: 13: Hoare triple {5371#(and (not (= |main_#t~mem3.base| main_~x~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} SUMMARY for call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem3.base, 4 + #t~mem3.offset, 4); srcloc: L998 {5372#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} is VALID [2020-07-29 01:19:00,594 INFO L280 TraceCheckUtils]: 14: Hoare triple {5372#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} havoc #t~mem3.base, #t~mem3.offset; {5372#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} is VALID [2020-07-29 01:19:00,595 INFO L280 TraceCheckUtils]: 15: Hoare triple {5372#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} SUMMARY for call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L999 {5373#(and (= 12 (select |#length| |main_#t~mem4.base|)) (= 0 |main_#t~mem4.offset|))} is VALID [2020-07-29 01:19:00,596 INFO L280 TraceCheckUtils]: 16: Hoare triple {5373#(and (= 12 (select |#length| |main_#t~mem4.base|)) (= 0 |main_#t~mem4.offset|))} ~x~0.base, ~x~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset; {5374#(and (= 12 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0))} is VALID [2020-07-29 01:19:00,597 INFO L280 TraceCheckUtils]: 17: Hoare triple {5374#(and (= 12 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0))} assume !(4 + ~x~0.offset <= #length[~x~0.base] && 0 <= ~x~0.offset); {5363#false} is VALID [2020-07-29 01:19:00,598 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:00,599 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713876989] [2020-07-29 01:19:00,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:00,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-29 01:19:00,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159619031] [2020-07-29 01:19:00,599 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2020-07-29 01:19:00,600 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:00,600 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-29 01:19:00,623 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:00,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-29 01:19:00,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:00,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-29 01:19:00,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-07-29 01:19:00,625 INFO L87 Difference]: Start difference. First operand 112 states and 126 transitions. Second operand 11 states. [2020-07-29 01:19:02,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:02,617 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2020-07-29 01:19:02,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-29 01:19:02,617 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2020-07-29 01:19:02,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:02,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-29 01:19:02,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 115 transitions. [2020-07-29 01:19:02,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-29 01:19:02,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 115 transitions. [2020-07-29 01:19:02,622 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 115 transitions. [2020-07-29 01:19:02,786 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:02,788 INFO L225 Difference]: With dead ends: 116 [2020-07-29 01:19:02,788 INFO L226 Difference]: Without dead ends: 116 [2020-07-29 01:19:02,789 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2020-07-29 01:19:02,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-07-29 01:19:02,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 101. [2020-07-29 01:19:02,792 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:02,792 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand 101 states. [2020-07-29 01:19:02,792 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand 101 states. [2020-07-29 01:19:02,793 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 101 states. [2020-07-29 01:19:02,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:02,795 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2020-07-29 01:19:02,796 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 131 transitions. [2020-07-29 01:19:02,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:02,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:02,797 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 116 states. [2020-07-29 01:19:02,797 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 116 states. [2020-07-29 01:19:02,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:02,800 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2020-07-29 01:19:02,800 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 131 transitions. [2020-07-29 01:19:02,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:02,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:02,801 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:02,801 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:02,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-07-29 01:19:02,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 115 transitions. [2020-07-29 01:19:02,804 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 115 transitions. Word has length 18 [2020-07-29 01:19:02,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:02,804 INFO L479 AbstractCegarLoop]: Abstraction has 101 states and 115 transitions. [2020-07-29 01:19:02,804 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-29 01:19:02,804 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 115 transitions. [2020-07-29 01:19:02,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-29 01:19:02,805 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:02,805 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] [2020-07-29 01:19:02,806 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-29 01:19:02,806 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:19:02,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:02,807 INFO L82 PathProgramCache]: Analyzing trace with hash 975241550, now seen corresponding path program 1 times [2020-07-29 01:19:02,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:02,807 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189139177] [2020-07-29 01:19:02,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:02,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:03,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:03,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:03,015 INFO L280 TraceCheckUtils]: 0: Hoare triple {5861#(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; {5849#true} is VALID [2020-07-29 01:19:03,015 INFO L280 TraceCheckUtils]: 1: Hoare triple {5849#true} assume true; {5849#true} is VALID [2020-07-29 01:19:03,015 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5849#true} {5849#true} #204#return; {5849#true} is VALID [2020-07-29 01:19:03,017 INFO L263 TraceCheckUtils]: 0: Hoare triple {5849#true} call ULTIMATE.init(); {5861#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:03,017 INFO L280 TraceCheckUtils]: 1: Hoare triple {5861#(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; {5849#true} is VALID [2020-07-29 01:19:03,017 INFO L280 TraceCheckUtils]: 2: Hoare triple {5849#true} assume true; {5849#true} is VALID [2020-07-29 01:19:03,017 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5849#true} {5849#true} #204#return; {5849#true} is VALID [2020-07-29 01:19:03,017 INFO L263 TraceCheckUtils]: 4: Hoare triple {5849#true} call #t~ret18 := main(); {5849#true} is VALID [2020-07-29 01:19:03,019 INFO L280 TraceCheckUtils]: 5: Hoare triple {5849#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {5854#(= 0 main_~head~0.offset)} is VALID [2020-07-29 01:19:03,020 INFO L280 TraceCheckUtils]: 6: Hoare triple {5854#(= 0 main_~head~0.offset)} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset, 4); srcloc: L987 {5855#(and (= 1 (select |#valid| main_~head~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) main_~head~0.offset) (= 0 main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base))} is VALID [2020-07-29 01:19:03,023 INFO L280 TraceCheckUtils]: 7: Hoare triple {5855#(and (= 1 (select |#valid| main_~head~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) main_~head~0.offset) (= 0 main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base))} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L987-1 {5855#(and (= 1 (select |#valid| main_~head~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) main_~head~0.offset) (= 0 main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base))} is VALID [2020-07-29 01:19:03,025 INFO L280 TraceCheckUtils]: 8: Hoare triple {5855#(and (= 1 (select |#valid| main_~head~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) main_~head~0.offset) (= 0 main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;~state~0 := 1; {5856#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) main_~head~0.base))} is VALID [2020-07-29 01:19:03,026 INFO L280 TraceCheckUtils]: 9: Hoare triple {5856#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) main_~head~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {5856#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) main_~head~0.base))} is VALID [2020-07-29 01:19:03,028 INFO L280 TraceCheckUtils]: 10: Hoare triple {5856#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) main_~head~0.base))} assume !(0 != #t~nondet1);havoc #t~nondet1; {5856#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) main_~head~0.base))} is VALID [2020-07-29 01:19:03,030 INFO L280 TraceCheckUtils]: 11: Hoare triple {5856#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) main_~head~0.base))} SUMMARY for call write~int(~state~0, ~x~0.base, 8 + ~x~0.offset, 4); srcloc: L994-3 {5857#(and (= 1 (select |#valid| main_~head~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base))} is VALID [2020-07-29 01:19:03,031 INFO L280 TraceCheckUtils]: 12: Hoare triple {5857#(and (= 1 (select |#valid| main_~head~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base))} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); srcloc: L1016 {5858#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem6.base|) |main_#t~mem6.offset|)))} is VALID [2020-07-29 01:19:03,032 INFO L280 TraceCheckUtils]: 13: Hoare triple {5858#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem6.base|) |main_#t~mem6.offset|)))} ~x~0.base, ~x~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {5859#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-29 01:19:03,032 INFO L280 TraceCheckUtils]: 14: Hoare triple {5859#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} assume !!(0 != ~x~0.base || 0 != ~x~0.offset); {5859#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-29 01:19:03,033 INFO L280 TraceCheckUtils]: 15: Hoare triple {5859#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} goto; {5859#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-29 01:19:03,034 INFO L280 TraceCheckUtils]: 16: Hoare triple {5859#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} SUMMARY for call #t~mem7 := read~int(~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1021-2 {5859#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-29 01:19:03,035 INFO L280 TraceCheckUtils]: 17: Hoare triple {5859#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} assume !!(0 != #t~mem7);havoc #t~mem7; {5859#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-29 01:19:03,036 INFO L280 TraceCheckUtils]: 18: Hoare triple {5859#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} SUMMARY for call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1023-13 {5860#(= 1 (select |#valid| |main_#t~mem8.base|))} is VALID [2020-07-29 01:19:03,037 INFO L280 TraceCheckUtils]: 19: Hoare triple {5860#(= 1 (select |#valid| |main_#t~mem8.base|))} assume !(1 == #valid[#t~mem8.base]); {5850#false} is VALID [2020-07-29 01:19:03,039 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:03,039 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189139177] [2020-07-29 01:19:03,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:03,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-29 01:19:03,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044036182] [2020-07-29 01:19:03,040 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-07-29 01:19:03,040 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:03,040 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-29 01:19:03,072 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:03,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-29 01:19:03,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:03,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-29 01:19:03,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:19:03,073 INFO L87 Difference]: Start difference. First operand 101 states and 115 transitions. Second operand 10 states. [2020-07-29 01:19:04,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:04,558 INFO L93 Difference]: Finished difference Result 147 states and 159 transitions. [2020-07-29 01:19:04,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-29 01:19:04,558 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-07-29 01:19:04,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:04,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:19:04,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 160 transitions. [2020-07-29 01:19:04,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:19:04,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 160 transitions. [2020-07-29 01:19:04,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 160 transitions. [2020-07-29 01:19:04,767 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:04,770 INFO L225 Difference]: With dead ends: 147 [2020-07-29 01:19:04,770 INFO L226 Difference]: Without dead ends: 147 [2020-07-29 01:19:04,771 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2020-07-29 01:19:04,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-07-29 01:19:04,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 101. [2020-07-29 01:19:04,775 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:04,775 INFO L82 GeneralOperation]: Start isEquivalent. First operand 147 states. Second operand 101 states. [2020-07-29 01:19:04,775 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand 101 states. [2020-07-29 01:19:04,776 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 101 states. [2020-07-29 01:19:04,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:04,780 INFO L93 Difference]: Finished difference Result 147 states and 159 transitions. [2020-07-29 01:19:04,780 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 159 transitions. [2020-07-29 01:19:04,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:04,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:04,781 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 147 states. [2020-07-29 01:19:04,781 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 147 states. [2020-07-29 01:19:04,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:04,785 INFO L93 Difference]: Finished difference Result 147 states and 159 transitions. [2020-07-29 01:19:04,785 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 159 transitions. [2020-07-29 01:19:04,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:04,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:04,787 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:04,787 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:04,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-07-29 01:19:04,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2020-07-29 01:19:04,790 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 20 [2020-07-29 01:19:04,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:04,790 INFO L479 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2020-07-29 01:19:04,790 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-29 01:19:04,791 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2020-07-29 01:19:04,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-29 01:19:04,791 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:04,791 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] [2020-07-29 01:19:04,792 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-29 01:19:04,792 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:19:04,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:04,793 INFO L82 PathProgramCache]: Analyzing trace with hash 975241551, now seen corresponding path program 1 times [2020-07-29 01:19:04,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:04,794 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924862346] [2020-07-29 01:19:04,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:04,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:05,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:05,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:05,061 INFO L280 TraceCheckUtils]: 0: Hoare triple {6429#(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; {6418#true} is VALID [2020-07-29 01:19:05,061 INFO L280 TraceCheckUtils]: 1: Hoare triple {6418#true} assume true; {6418#true} is VALID [2020-07-29 01:19:05,061 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {6418#true} {6418#true} #204#return; {6418#true} is VALID [2020-07-29 01:19:05,062 INFO L263 TraceCheckUtils]: 0: Hoare triple {6418#true} call ULTIMATE.init(); {6429#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:05,063 INFO L280 TraceCheckUtils]: 1: Hoare triple {6429#(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; {6418#true} is VALID [2020-07-29 01:19:05,063 INFO L280 TraceCheckUtils]: 2: Hoare triple {6418#true} assume true; {6418#true} is VALID [2020-07-29 01:19:05,063 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6418#true} {6418#true} #204#return; {6418#true} is VALID [2020-07-29 01:19:05,063 INFO L263 TraceCheckUtils]: 4: Hoare triple {6418#true} call #t~ret18 := main(); {6418#true} is VALID [2020-07-29 01:19:05,065 INFO L280 TraceCheckUtils]: 5: Hoare triple {6418#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {6423#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)))} is VALID [2020-07-29 01:19:05,066 INFO L280 TraceCheckUtils]: 6: Hoare triple {6423#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)))} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset, 4); srcloc: L987 {6424#(and (= (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 12) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) main_~head~0.offset) (= 0 main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base))} is VALID [2020-07-29 01:19:05,068 INFO L280 TraceCheckUtils]: 7: Hoare triple {6424#(and (= (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 12) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) main_~head~0.offset) (= 0 main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base))} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L987-1 {6424#(and (= (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 12) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) main_~head~0.offset) (= 0 main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base))} is VALID [2020-07-29 01:19:05,070 INFO L280 TraceCheckUtils]: 8: Hoare triple {6424#(and (= (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 12) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) main_~head~0.offset) (= 0 main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;~state~0 := 1; {6425#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) main_~head~0.base))} is VALID [2020-07-29 01:19:05,071 INFO L280 TraceCheckUtils]: 9: Hoare triple {6425#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) main_~head~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {6425#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) main_~head~0.base))} is VALID [2020-07-29 01:19:05,073 INFO L280 TraceCheckUtils]: 10: Hoare triple {6425#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) main_~head~0.base))} assume !(0 != #t~nondet1);havoc #t~nondet1; {6425#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) main_~head~0.base))} is VALID [2020-07-29 01:19:05,075 INFO L280 TraceCheckUtils]: 11: Hoare triple {6425#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) main_~head~0.base))} SUMMARY for call write~int(~state~0, ~x~0.base, 8 + ~x~0.offset, 4); srcloc: L994-3 {6424#(and (= (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 12) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) main_~head~0.offset) (= 0 main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base))} is VALID [2020-07-29 01:19:05,077 INFO L280 TraceCheckUtils]: 12: Hoare triple {6424#(and (= (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 12) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) main_~head~0.offset) (= 0 main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base))} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); srcloc: L1016 {6426#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem6.base|) |main_#t~mem6.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |main_#t~mem6.base|) |main_#t~mem6.offset|) 0))} is VALID [2020-07-29 01:19:05,078 INFO L280 TraceCheckUtils]: 13: Hoare triple {6426#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem6.base|) |main_#t~mem6.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |main_#t~mem6.base|) |main_#t~mem6.offset|) 0))} ~x~0.base, ~x~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {6427#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} is VALID [2020-07-29 01:19:05,079 INFO L280 TraceCheckUtils]: 14: Hoare triple {6427#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} assume !!(0 != ~x~0.base || 0 != ~x~0.offset); {6427#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} is VALID [2020-07-29 01:19:05,080 INFO L280 TraceCheckUtils]: 15: Hoare triple {6427#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} goto; {6427#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} is VALID [2020-07-29 01:19:05,081 INFO L280 TraceCheckUtils]: 16: Hoare triple {6427#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} SUMMARY for call #t~mem7 := read~int(~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1021-2 {6427#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} is VALID [2020-07-29 01:19:05,082 INFO L280 TraceCheckUtils]: 17: Hoare triple {6427#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} assume !!(0 != #t~mem7);havoc #t~mem7; {6427#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} is VALID [2020-07-29 01:19:05,083 INFO L280 TraceCheckUtils]: 18: Hoare triple {6427#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} SUMMARY for call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1023-13 {6428#(and (= 12 (select |#length| |main_#t~mem8.base|)) (= 0 |main_#t~mem8.offset|))} is VALID [2020-07-29 01:19:05,084 INFO L280 TraceCheckUtils]: 19: Hoare triple {6428#(and (= 12 (select |#length| |main_#t~mem8.base|)) (= 0 |main_#t~mem8.offset|))} assume !(4 + (8 + #t~mem8.offset) <= #length[#t~mem8.base] && 0 <= 8 + #t~mem8.offset); {6419#false} is VALID [2020-07-29 01:19:05,087 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:05,087 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924862346] [2020-07-29 01:19:05,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:05,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-29 01:19:05,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677520004] [2020-07-29 01:19:05,088 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2020-07-29 01:19:05,088 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:05,089 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 01:19:05,120 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:05,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-29 01:19:05,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:05,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-29 01:19:05,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:19:05,121 INFO L87 Difference]: Start difference. First operand 101 states and 114 transitions. Second operand 9 states. [2020-07-29 01:19:06,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:06,551 INFO L93 Difference]: Finished difference Result 159 states and 170 transitions. [2020-07-29 01:19:06,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-29 01:19:06,551 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2020-07-29 01:19:06,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:06,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 01:19:06,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 171 transitions. [2020-07-29 01:19:06,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 01:19:06,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 171 transitions. [2020-07-29 01:19:06,556 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 171 transitions. [2020-07-29 01:19:06,802 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:06,805 INFO L225 Difference]: With dead ends: 159 [2020-07-29 01:19:06,806 INFO L226 Difference]: Without dead ends: 159 [2020-07-29 01:19:06,806 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-07-29 01:19:06,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2020-07-29 01:19:06,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 101. [2020-07-29 01:19:06,811 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:06,811 INFO L82 GeneralOperation]: Start isEquivalent. First operand 159 states. Second operand 101 states. [2020-07-29 01:19:06,811 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand 101 states. [2020-07-29 01:19:06,811 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 101 states. [2020-07-29 01:19:06,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:06,816 INFO L93 Difference]: Finished difference Result 159 states and 170 transitions. [2020-07-29 01:19:06,816 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 170 transitions. [2020-07-29 01:19:06,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:06,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:06,817 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 159 states. [2020-07-29 01:19:06,817 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 159 states. [2020-07-29 01:19:06,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:06,821 INFO L93 Difference]: Finished difference Result 159 states and 170 transitions. [2020-07-29 01:19:06,821 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 170 transitions. [2020-07-29 01:19:06,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:06,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:06,822 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:06,823 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:06,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-07-29 01:19:06,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2020-07-29 01:19:06,825 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 20 [2020-07-29 01:19:06,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:06,826 INFO L479 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2020-07-29 01:19:06,826 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-29 01:19:06,826 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2020-07-29 01:19:06,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-29 01:19:06,828 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:06,829 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:19:06,829 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-29 01:19:06,832 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:19:06,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:06,833 INFO L82 PathProgramCache]: Analyzing trace with hash 167702177, now seen corresponding path program 1 times [2020-07-29 01:19:06,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:06,841 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356036877] [2020-07-29 01:19:06,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:06,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:06,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:06,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:06,951 INFO L280 TraceCheckUtils]: 0: Hoare triple {7030#(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; {7020#true} is VALID [2020-07-29 01:19:06,952 INFO L280 TraceCheckUtils]: 1: Hoare triple {7020#true} assume true; {7020#true} is VALID [2020-07-29 01:19:06,952 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {7020#true} {7020#true} #204#return; {7020#true} is VALID [2020-07-29 01:19:06,953 INFO L263 TraceCheckUtils]: 0: Hoare triple {7020#true} call ULTIMATE.init(); {7030#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:06,954 INFO L280 TraceCheckUtils]: 1: Hoare triple {7030#(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; {7020#true} is VALID [2020-07-29 01:19:06,954 INFO L280 TraceCheckUtils]: 2: Hoare triple {7020#true} assume true; {7020#true} is VALID [2020-07-29 01:19:06,954 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7020#true} {7020#true} #204#return; {7020#true} is VALID [2020-07-29 01:19:06,954 INFO L263 TraceCheckUtils]: 4: Hoare triple {7020#true} call #t~ret18 := main(); {7020#true} is VALID [2020-07-29 01:19:06,955 INFO L280 TraceCheckUtils]: 5: Hoare triple {7020#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {7020#true} is VALID [2020-07-29 01:19:06,955 INFO L280 TraceCheckUtils]: 6: Hoare triple {7020#true} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset, 4); srcloc: L987 {7020#true} is VALID [2020-07-29 01:19:06,955 INFO L280 TraceCheckUtils]: 7: Hoare triple {7020#true} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L987-1 {7020#true} is VALID [2020-07-29 01:19:06,955 INFO L280 TraceCheckUtils]: 8: Hoare triple {7020#true} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;~state~0 := 1; {7020#true} is VALID [2020-07-29 01:19:06,955 INFO L280 TraceCheckUtils]: 9: Hoare triple {7020#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {7020#true} is VALID [2020-07-29 01:19:06,956 INFO L280 TraceCheckUtils]: 10: Hoare triple {7020#true} assume !(0 != #t~nondet1);havoc #t~nondet1; {7020#true} is VALID [2020-07-29 01:19:06,956 INFO L280 TraceCheckUtils]: 11: Hoare triple {7020#true} SUMMARY for call write~int(~state~0, ~x~0.base, 8 + ~x~0.offset, 4); srcloc: L994-3 {7020#true} is VALID [2020-07-29 01:19:06,958 INFO L280 TraceCheckUtils]: 12: Hoare triple {7020#true} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); srcloc: L1016 {7025#(= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)} is VALID [2020-07-29 01:19:06,959 INFO L280 TraceCheckUtils]: 13: Hoare triple {7025#(= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)} ~x~0.base, ~x~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {7026#(= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base)} is VALID [2020-07-29 01:19:06,959 INFO L280 TraceCheckUtils]: 14: Hoare triple {7026#(= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base)} assume !!(0 != ~x~0.base || 0 != ~x~0.offset); {7026#(= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base)} is VALID [2020-07-29 01:19:06,962 INFO L280 TraceCheckUtils]: 15: Hoare triple {7026#(= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base)} goto; {7026#(= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base)} is VALID [2020-07-29 01:19:06,964 INFO L280 TraceCheckUtils]: 16: Hoare triple {7026#(= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base)} SUMMARY for call #t~mem7 := read~int(~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1021-2 {7027#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))} is VALID [2020-07-29 01:19:06,965 INFO L280 TraceCheckUtils]: 17: Hoare triple {7027#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))} assume !(0 != #t~mem7);havoc #t~mem7; {7027#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))} is VALID [2020-07-29 01:19:06,967 INFO L280 TraceCheckUtils]: 18: Hoare triple {7027#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))} SUMMARY for call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); srcloc: L1021-3 {7028#(= 1 (select |#valid| |main_#t~mem15.base|))} is VALID [2020-07-29 01:19:06,968 INFO L280 TraceCheckUtils]: 19: Hoare triple {7028#(= 1 (select |#valid| |main_#t~mem15.base|))} ~x~0.base, ~x~0.offset := #t~mem15.base, #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; {7029#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-29 01:19:06,969 INFO L280 TraceCheckUtils]: 20: Hoare triple {7029#(= 1 (select |#valid| main_~x~0.base))} assume !(1 == #valid[~x~0.base]); {7021#false} is VALID [2020-07-29 01:19:06,970 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:06,970 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356036877] [2020-07-29 01:19:06,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:06,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-29 01:19:06,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309571810] [2020-07-29 01:19:06,972 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2020-07-29 01:19:06,972 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:06,972 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-29 01:19:06,998 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:06,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-29 01:19:06,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:06,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-29 01:19:06,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-07-29 01:19:06,999 INFO L87 Difference]: Start difference. First operand 101 states and 113 transitions. Second operand 8 states. [2020-07-29 01:19:08,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:08,139 INFO L93 Difference]: Finished difference Result 138 states and 153 transitions. [2020-07-29 01:19:08,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-29 01:19:08,139 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2020-07-29 01:19:08,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:08,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:19:08,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 132 transitions. [2020-07-29 01:19:08,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:19:08,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 132 transitions. [2020-07-29 01:19:08,145 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 132 transitions. [2020-07-29 01:19:08,329 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:08,332 INFO L225 Difference]: With dead ends: 138 [2020-07-29 01:19:08,332 INFO L226 Difference]: Without dead ends: 138 [2020-07-29 01:19:08,333 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2020-07-29 01:19:08,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-07-29 01:19:08,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 102. [2020-07-29 01:19:08,339 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:08,339 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand 102 states. [2020-07-29 01:19:08,339 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 102 states. [2020-07-29 01:19:08,339 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 102 states. [2020-07-29 01:19:08,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:08,343 INFO L93 Difference]: Finished difference Result 138 states and 153 transitions. [2020-07-29 01:19:08,344 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 153 transitions. [2020-07-29 01:19:08,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:08,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:08,345 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 138 states. [2020-07-29 01:19:08,345 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 138 states. [2020-07-29 01:19:08,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:08,349 INFO L93 Difference]: Finished difference Result 138 states and 153 transitions. [2020-07-29 01:19:08,350 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 153 transitions. [2020-07-29 01:19:08,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:08,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:08,351 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:08,351 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:08,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-07-29 01:19:08,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2020-07-29 01:19:08,354 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 21 [2020-07-29 01:19:08,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:08,355 INFO L479 AbstractCegarLoop]: Abstraction has 102 states and 115 transitions. [2020-07-29 01:19:08,355 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-29 01:19:08,355 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2020-07-29 01:19:08,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-29 01:19:08,356 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:08,356 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:19:08,357 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-29 01:19:08,357 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:19:08,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:08,358 INFO L82 PathProgramCache]: Analyzing trace with hash 167702178, now seen corresponding path program 1 times [2020-07-29 01:19:08,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:08,358 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429793171] [2020-07-29 01:19:08,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:08,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:08,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:08,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:08,758 INFO L280 TraceCheckUtils]: 0: Hoare triple {7573#(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; {7559#true} is VALID [2020-07-29 01:19:08,759 INFO L280 TraceCheckUtils]: 1: Hoare triple {7559#true} assume true; {7559#true} is VALID [2020-07-29 01:19:08,759 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {7559#true} {7559#true} #204#return; {7559#true} is VALID [2020-07-29 01:19:08,762 INFO L263 TraceCheckUtils]: 0: Hoare triple {7559#true} call ULTIMATE.init(); {7573#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:08,763 INFO L280 TraceCheckUtils]: 1: Hoare triple {7573#(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; {7559#true} is VALID [2020-07-29 01:19:08,763 INFO L280 TraceCheckUtils]: 2: Hoare triple {7559#true} assume true; {7559#true} is VALID [2020-07-29 01:19:08,763 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7559#true} {7559#true} #204#return; {7559#true} is VALID [2020-07-29 01:19:08,763 INFO L263 TraceCheckUtils]: 4: Hoare triple {7559#true} call #t~ret18 := main(); {7559#true} is VALID [2020-07-29 01:19:08,768 INFO L280 TraceCheckUtils]: 5: Hoare triple {7559#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {7564#(= 0 main_~head~0.offset)} is VALID [2020-07-29 01:19:08,769 INFO L280 TraceCheckUtils]: 6: Hoare triple {7564#(= 0 main_~head~0.offset)} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset, 4); srcloc: L987 {7565#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 0 main_~head~0.offset))} is VALID [2020-07-29 01:19:08,771 INFO L280 TraceCheckUtils]: 7: Hoare triple {7565#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 0 main_~head~0.offset))} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L987-1 {7565#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 0 main_~head~0.offset))} is VALID [2020-07-29 01:19:08,772 INFO L280 TraceCheckUtils]: 8: Hoare triple {7565#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 0 main_~head~0.offset))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;~state~0 := 1; {7566#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)))} is VALID [2020-07-29 01:19:08,773 INFO L280 TraceCheckUtils]: 9: Hoare triple {7566#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {7566#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)))} is VALID [2020-07-29 01:19:08,773 INFO L280 TraceCheckUtils]: 10: Hoare triple {7566#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)))} assume !(0 != #t~nondet1);havoc #t~nondet1; {7566#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)))} is VALID [2020-07-29 01:19:08,775 INFO L280 TraceCheckUtils]: 11: Hoare triple {7566#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)))} SUMMARY for call write~int(~state~0, ~x~0.base, 8 + ~x~0.offset, 4); srcloc: L994-3 {7567#(= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))} is VALID [2020-07-29 01:19:08,776 INFO L280 TraceCheckUtils]: 12: Hoare triple {7567#(= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); srcloc: L1016 {7568#(and (= 0 |main_#t~mem6.offset|) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.offset|) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|))} is VALID [2020-07-29 01:19:08,777 INFO L280 TraceCheckUtils]: 13: Hoare triple {7568#(and (= 0 |main_#t~mem6.offset|) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.offset|) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|))} ~x~0.base, ~x~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {7569#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base))} is VALID [2020-07-29 01:19:08,778 INFO L280 TraceCheckUtils]: 14: Hoare triple {7569#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base))} assume !!(0 != ~x~0.base || 0 != ~x~0.offset); {7569#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base))} is VALID [2020-07-29 01:19:08,779 INFO L280 TraceCheckUtils]: 15: Hoare triple {7569#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base))} goto; {7569#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base))} is VALID [2020-07-29 01:19:08,780 INFO L280 TraceCheckUtils]: 16: Hoare triple {7569#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base))} SUMMARY for call #t~mem7 := read~int(~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1021-2 {7570#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 12) (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))} is VALID [2020-07-29 01:19:08,780 INFO L280 TraceCheckUtils]: 17: Hoare triple {7570#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 12) (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))} assume !(0 != #t~mem7);havoc #t~mem7; {7570#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 12) (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))} is VALID [2020-07-29 01:19:08,781 INFO L280 TraceCheckUtils]: 18: Hoare triple {7570#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 12) (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))} SUMMARY for call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); srcloc: L1021-3 {7571#(and (<= 0 |main_#t~mem15.offset|) (<= (+ |main_#t~mem15.offset| 12) (select |#length| |main_#t~mem15.base|)))} is VALID [2020-07-29 01:19:08,782 INFO L280 TraceCheckUtils]: 19: Hoare triple {7571#(and (<= 0 |main_#t~mem15.offset|) (<= (+ |main_#t~mem15.offset| 12) (select |#length| |main_#t~mem15.base|)))} ~x~0.base, ~x~0.offset := #t~mem15.base, #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; {7572#(and (<= (+ main_~x~0.offset 12) (select |#length| main_~x~0.base)) (<= 0 main_~x~0.offset))} is VALID [2020-07-29 01:19:08,783 INFO L280 TraceCheckUtils]: 20: Hoare triple {7572#(and (<= (+ main_~x~0.offset 12) (select |#length| main_~x~0.base)) (<= 0 main_~x~0.offset))} assume !(4 + (8 + ~x~0.offset) <= #length[~x~0.base] && 0 <= 8 + ~x~0.offset); {7560#false} is VALID [2020-07-29 01:19:08,787 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:08,787 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429793171] [2020-07-29 01:19:08,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:08,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-29 01:19:08,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818590419] [2020-07-29 01:19:08,788 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2020-07-29 01:19:08,788 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:08,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-29 01:19:08,820 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:08,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-29 01:19:08,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:08,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-29 01:19:08,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2020-07-29 01:19:08,821 INFO L87 Difference]: Start difference. First operand 102 states and 115 transitions. Second operand 12 states. [2020-07-29 01:19:10,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:10,797 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2020-07-29 01:19:10,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-29 01:19:10,797 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2020-07-29 01:19:10,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:10,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-29 01:19:10,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 161 transitions. [2020-07-29 01:19:10,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-29 01:19:10,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 161 transitions. [2020-07-29 01:19:10,805 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 161 transitions. [2020-07-29 01:19:10,998 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:11,000 INFO L225 Difference]: With dead ends: 149 [2020-07-29 01:19:11,001 INFO L226 Difference]: Without dead ends: 149 [2020-07-29 01:19:11,001 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2020-07-29 01:19:11,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2020-07-29 01:19:11,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 121. [2020-07-29 01:19:11,005 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:11,005 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand 121 states. [2020-07-29 01:19:11,005 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand 121 states. [2020-07-29 01:19:11,006 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 121 states. [2020-07-29 01:19:11,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:11,010 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2020-07-29 01:19:11,010 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 161 transitions. [2020-07-29 01:19:11,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:11,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:11,011 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 149 states. [2020-07-29 01:19:11,011 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 149 states. [2020-07-29 01:19:11,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:11,016 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2020-07-29 01:19:11,016 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 161 transitions. [2020-07-29 01:19:11,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:11,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:11,017 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:11,017 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:11,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-07-29 01:19:11,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 148 transitions. [2020-07-29 01:19:11,021 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 148 transitions. Word has length 21 [2020-07-29 01:19:11,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:11,022 INFO L479 AbstractCegarLoop]: Abstraction has 121 states and 148 transitions. [2020-07-29 01:19:11,022 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-29 01:19:11,022 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 148 transitions. [2020-07-29 01:19:11,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-29 01:19:11,023 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:11,023 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, 1] [2020-07-29 01:19:11,023 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-29 01:19:11,024 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:19:11,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:11,024 INFO L82 PathProgramCache]: Analyzing trace with hash -2046960464, now seen corresponding path program 1 times [2020-07-29 01:19:11,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:11,025 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468309670] [2020-07-29 01:19:11,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:11,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:11,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:11,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:11,383 INFO L280 TraceCheckUtils]: 0: Hoare triple {8174#(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; {8160#true} is VALID [2020-07-29 01:19:11,383 INFO L280 TraceCheckUtils]: 1: Hoare triple {8160#true} assume true; {8160#true} is VALID [2020-07-29 01:19:11,383 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {8160#true} {8160#true} #204#return; {8160#true} is VALID [2020-07-29 01:19:11,386 INFO L263 TraceCheckUtils]: 0: Hoare triple {8160#true} call ULTIMATE.init(); {8174#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:11,386 INFO L280 TraceCheckUtils]: 1: Hoare triple {8174#(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; {8160#true} is VALID [2020-07-29 01:19:11,387 INFO L280 TraceCheckUtils]: 2: Hoare triple {8160#true} assume true; {8160#true} is VALID [2020-07-29 01:19:11,387 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8160#true} {8160#true} #204#return; {8160#true} is VALID [2020-07-29 01:19:11,387 INFO L263 TraceCheckUtils]: 4: Hoare triple {8160#true} call #t~ret18 := main(); {8160#true} is VALID [2020-07-29 01:19:11,389 INFO L280 TraceCheckUtils]: 5: Hoare triple {8160#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {8165#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)))} is VALID [2020-07-29 01:19:11,391 INFO L280 TraceCheckUtils]: 6: Hoare triple {8165#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)))} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset, 4); srcloc: L987 {8166#(and (= (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 12) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 0 main_~head~0.offset))} is VALID [2020-07-29 01:19:11,393 INFO L280 TraceCheckUtils]: 7: Hoare triple {8166#(and (= (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 12) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 0 main_~head~0.offset))} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L987-1 {8166#(and (= (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 12) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 0 main_~head~0.offset))} is VALID [2020-07-29 01:19:11,395 INFO L280 TraceCheckUtils]: 8: Hoare triple {8166#(and (= (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 12) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 0 main_~head~0.offset))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;~state~0 := 1; {8167#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)))} is VALID [2020-07-29 01:19:11,396 INFO L280 TraceCheckUtils]: 9: Hoare triple {8167#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {8167#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)))} is VALID [2020-07-29 01:19:11,397 INFO L280 TraceCheckUtils]: 10: Hoare triple {8167#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)))} assume !(0 != #t~nondet1);havoc #t~nondet1; {8167#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)))} is VALID [2020-07-29 01:19:11,399 INFO L280 TraceCheckUtils]: 11: Hoare triple {8167#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)))} SUMMARY for call write~int(~state~0, ~x~0.base, 8 + ~x~0.offset, 4); srcloc: L994-3 {8168#(and (= (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 12) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))} is VALID [2020-07-29 01:19:11,401 INFO L280 TraceCheckUtils]: 12: Hoare triple {8168#(and (= (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 12) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); srcloc: L1016 {8169#(and (= (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 12) (= 0 |main_#t~mem6.offset|) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.offset|))} is VALID [2020-07-29 01:19:11,401 INFO L280 TraceCheckUtils]: 13: Hoare triple {8169#(and (= (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 12) (= 0 |main_#t~mem6.offset|) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.offset|))} ~x~0.base, ~x~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {8170#(and (= (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 12) (<= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))} is VALID [2020-07-29 01:19:11,402 INFO L280 TraceCheckUtils]: 14: Hoare triple {8170#(and (= (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 12) (<= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))} assume !!(0 != ~x~0.base || 0 != ~x~0.offset); {8170#(and (= (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 12) (<= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))} is VALID [2020-07-29 01:19:11,403 INFO L280 TraceCheckUtils]: 15: Hoare triple {8170#(and (= (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 12) (<= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))} goto; {8170#(and (= (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 12) (<= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))} is VALID [2020-07-29 01:19:11,404 INFO L280 TraceCheckUtils]: 16: Hoare triple {8170#(and (= (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 12) (<= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))} SUMMARY for call #t~mem7 := read~int(~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1021-2 {8170#(and (= (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 12) (<= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))} is VALID [2020-07-29 01:19:11,405 INFO L280 TraceCheckUtils]: 17: Hoare triple {8170#(and (= (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 12) (<= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))} assume !(0 != #t~mem7);havoc #t~mem7; {8170#(and (= (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 12) (<= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))} is VALID [2020-07-29 01:19:11,406 INFO L280 TraceCheckUtils]: 18: Hoare triple {8170#(and (= (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 12) (<= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))} SUMMARY for call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); srcloc: L1021-3 {8171#(and (<= 0 |main_#t~mem15.offset|) (= 12 (select |#length| |main_#t~mem15.base|)))} is VALID [2020-07-29 01:19:11,407 INFO L280 TraceCheckUtils]: 19: Hoare triple {8171#(and (<= 0 |main_#t~mem15.offset|) (= 12 (select |#length| |main_#t~mem15.base|)))} ~x~0.base, ~x~0.offset := #t~mem15.base, #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; {8172#(and (or (= 12 (select |#length| main_~x~0.base)) (<= main_~x~0.offset 0)) (< 0 (+ main_~x~0.offset 1)))} is VALID [2020-07-29 01:19:11,408 INFO L280 TraceCheckUtils]: 20: Hoare triple {8172#(and (or (= 12 (select |#length| main_~x~0.base)) (<= main_~x~0.offset 0)) (< 0 (+ main_~x~0.offset 1)))} SUMMARY for call #t~mem16 := read~int(~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1029-3 {8173#(and (<= main_~x~0.offset 0) (< 0 (+ main_~x~0.offset 1)))} is VALID [2020-07-29 01:19:11,409 INFO L280 TraceCheckUtils]: 21: Hoare triple {8173#(and (<= main_~x~0.offset 0) (< 0 (+ main_~x~0.offset 1)))} assume !(0 != #t~mem16);havoc #t~mem16; {8173#(and (<= main_~x~0.offset 0) (< 0 (+ main_~x~0.offset 1)))} is VALID [2020-07-29 01:19:11,410 INFO L280 TraceCheckUtils]: 22: Hoare triple {8173#(and (<= main_~x~0.offset 0) (< 0 (+ main_~x~0.offset 1)))} assume !(0 == ~x~0.offset); {8161#false} is VALID [2020-07-29 01:19:11,413 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:11,413 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468309670] [2020-07-29 01:19:11,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:11,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-29 01:19:11,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658406047] [2020-07-29 01:19:11,414 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-07-29 01:19:11,414 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:11,417 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-29 01:19:11,450 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:11,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-29 01:19:11,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:11,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-29 01:19:11,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-07-29 01:19:11,451 INFO L87 Difference]: Start difference. First operand 121 states and 148 transitions. Second operand 12 states. [2020-07-29 01:19:13,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:13,456 INFO L93 Difference]: Finished difference Result 162 states and 173 transitions. [2020-07-29 01:19:13,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-29 01:19:13,456 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-07-29 01:19:13,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:13,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-29 01:19:13,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 174 transitions. [2020-07-29 01:19:13,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-29 01:19:13,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 174 transitions. [2020-07-29 01:19:13,463 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 174 transitions. [2020-07-29 01:19:13,703 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:13,706 INFO L225 Difference]: With dead ends: 162 [2020-07-29 01:19:13,707 INFO L226 Difference]: Without dead ends: 162 [2020-07-29 01:19:13,707 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2020-07-29 01:19:13,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-07-29 01:19:13,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 122. [2020-07-29 01:19:13,712 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:13,712 INFO L82 GeneralOperation]: Start isEquivalent. First operand 162 states. Second operand 122 states. [2020-07-29 01:19:13,712 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand 122 states. [2020-07-29 01:19:13,712 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 122 states. [2020-07-29 01:19:13,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:13,718 INFO L93 Difference]: Finished difference Result 162 states and 173 transitions. [2020-07-29 01:19:13,718 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 173 transitions. [2020-07-29 01:19:13,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:13,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:13,719 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 162 states. [2020-07-29 01:19:13,720 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 162 states. [2020-07-29 01:19:13,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:13,726 INFO L93 Difference]: Finished difference Result 162 states and 173 transitions. [2020-07-29 01:19:13,726 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 173 transitions. [2020-07-29 01:19:13,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:13,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:13,727 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:13,727 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:13,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-07-29 01:19:13,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 149 transitions. [2020-07-29 01:19:13,734 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 149 transitions. Word has length 23 [2020-07-29 01:19:13,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:13,734 INFO L479 AbstractCegarLoop]: Abstraction has 122 states and 149 transitions. [2020-07-29 01:19:13,734 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-29 01:19:13,734 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 149 transitions. [2020-07-29 01:19:13,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-29 01:19:13,735 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:13,736 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, 1] [2020-07-29 01:19:13,736 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-29 01:19:13,737 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:19:13,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:13,737 INFO L82 PathProgramCache]: Analyzing trace with hash -280035452, now seen corresponding path program 1 times [2020-07-29 01:19:13,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:13,738 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845357036] [2020-07-29 01:19:13,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:13,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:13,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:13,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:13,927 INFO L280 TraceCheckUtils]: 0: Hoare triple {8814#(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; {8801#true} is VALID [2020-07-29 01:19:13,927 INFO L280 TraceCheckUtils]: 1: Hoare triple {8801#true} assume true; {8801#true} is VALID [2020-07-29 01:19:13,927 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {8801#true} {8801#true} #204#return; {8801#true} is VALID [2020-07-29 01:19:13,931 INFO L263 TraceCheckUtils]: 0: Hoare triple {8801#true} call ULTIMATE.init(); {8814#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:13,931 INFO L280 TraceCheckUtils]: 1: Hoare triple {8814#(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; {8801#true} is VALID [2020-07-29 01:19:13,931 INFO L280 TraceCheckUtils]: 2: Hoare triple {8801#true} assume true; {8801#true} is VALID [2020-07-29 01:19:13,932 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8801#true} {8801#true} #204#return; {8801#true} is VALID [2020-07-29 01:19:13,932 INFO L263 TraceCheckUtils]: 4: Hoare triple {8801#true} call #t~ret18 := main(); {8801#true} is VALID [2020-07-29 01:19:13,932 INFO L280 TraceCheckUtils]: 5: Hoare triple {8801#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {8801#true} is VALID [2020-07-29 01:19:13,933 INFO L280 TraceCheckUtils]: 6: Hoare triple {8801#true} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset, 4); srcloc: L987 {8806#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-29 01:19:13,933 INFO L280 TraceCheckUtils]: 7: Hoare triple {8806#(= 1 (select |#valid| main_~head~0.base))} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L987-1 {8806#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-29 01:19:13,934 INFO L280 TraceCheckUtils]: 8: Hoare triple {8806#(= 1 (select |#valid| main_~head~0.base))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;~state~0 := 1; {8807#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-29 01:19:13,935 INFO L280 TraceCheckUtils]: 9: Hoare triple {8807#(= 1 (select |#valid| main_~x~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {8807#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-29 01:19:13,936 INFO L280 TraceCheckUtils]: 10: Hoare triple {8807#(= 1 (select |#valid| main_~x~0.base))} assume !!(0 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12); {8808#(and (not (= 0 |main_#t~malloc2.base|)) (not (= |main_#t~malloc2.base| main_~x~0.base)))} is VALID [2020-07-29 01:19:13,937 INFO L280 TraceCheckUtils]: 11: Hoare triple {8808#(and (not (= 0 |main_#t~malloc2.base|)) (not (= |main_#t~malloc2.base| main_~x~0.base)))} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L997 {8809#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))} is VALID [2020-07-29 01:19:13,938 INFO L280 TraceCheckUtils]: 12: Hoare triple {8809#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L997-1 {8810#(and (not (= |main_#t~mem3.base| main_~x~0.base)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} is VALID [2020-07-29 01:19:13,939 INFO L280 TraceCheckUtils]: 13: Hoare triple {8810#(and (not (= |main_#t~mem3.base| main_~x~0.base)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} SUMMARY for call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem3.base, 4 + #t~mem3.offset, 4); srcloc: L998 {8811#(not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-29 01:19:13,940 INFO L280 TraceCheckUtils]: 14: Hoare triple {8811#(not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} havoc #t~mem3.base, #t~mem3.offset; {8811#(not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-29 01:19:13,941 INFO L280 TraceCheckUtils]: 15: Hoare triple {8811#(not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} SUMMARY for call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L999 {8812#(not (= 0 |main_#t~mem4.base|))} is VALID [2020-07-29 01:19:13,941 INFO L280 TraceCheckUtils]: 16: Hoare triple {8812#(not (= 0 |main_#t~mem4.base|))} ~x~0.base, ~x~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset; {8813#(not (= 0 main_~x~0.base))} is VALID [2020-07-29 01:19:13,942 INFO L280 TraceCheckUtils]: 17: Hoare triple {8813#(not (= 0 main_~x~0.base))} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L1000 {8813#(not (= 0 main_~x~0.base))} is VALID [2020-07-29 01:19:13,943 INFO L280 TraceCheckUtils]: 18: Hoare triple {8813#(not (= 0 main_~x~0.base))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {8813#(not (= 0 main_~x~0.base))} is VALID [2020-07-29 01:19:13,943 INFO L280 TraceCheckUtils]: 19: Hoare triple {8813#(not (= 0 main_~x~0.base))} assume !(0 != #t~nondet5);havoc #t~nondet5; {8813#(not (= 0 main_~x~0.base))} is VALID [2020-07-29 01:19:13,944 INFO L280 TraceCheckUtils]: 20: Hoare triple {8813#(not (= 0 main_~x~0.base))} SUMMARY for call write~int(~state~0, ~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1002-1 {8813#(not (= 0 main_~x~0.base))} is VALID [2020-07-29 01:19:13,944 INFO L280 TraceCheckUtils]: 21: Hoare triple {8813#(not (= 0 main_~x~0.base))} assume !(0 != ~x~0.base || 0 != ~x~0.offset); {8802#false} is VALID [2020-07-29 01:19:13,945 INFO L280 TraceCheckUtils]: 22: Hoare triple {8802#false} assume !false; {8802#false} is VALID [2020-07-29 01:19:13,946 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:13,946 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845357036] [2020-07-29 01:19:13,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:13,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-29 01:19:13,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551057823] [2020-07-29 01:19:13,947 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2020-07-29 01:19:13,947 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:13,947 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-29 01:19:13,976 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:13,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-29 01:19:13,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:13,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-29 01:19:13,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-07-29 01:19:13,977 INFO L87 Difference]: Start difference. First operand 122 states and 149 transitions. Second operand 11 states. [2020-07-29 01:19:15,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:15,697 INFO L93 Difference]: Finished difference Result 133 states and 160 transitions. [2020-07-29 01:19:15,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-29 01:19:15,697 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2020-07-29 01:19:15,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:15,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-29 01:19:15,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 107 transitions. [2020-07-29 01:19:15,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-29 01:19:15,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 107 transitions. [2020-07-29 01:19:15,700 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 107 transitions. [2020-07-29 01:19:15,849 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:15,852 INFO L225 Difference]: With dead ends: 133 [2020-07-29 01:19:15,852 INFO L226 Difference]: Without dead ends: 133 [2020-07-29 01:19:15,852 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2020-07-29 01:19:15,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-07-29 01:19:15,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 120. [2020-07-29 01:19:15,855 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:15,855 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand 120 states. [2020-07-29 01:19:15,855 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 120 states. [2020-07-29 01:19:15,856 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 120 states. [2020-07-29 01:19:15,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:15,859 INFO L93 Difference]: Finished difference Result 133 states and 160 transitions. [2020-07-29 01:19:15,859 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 160 transitions. [2020-07-29 01:19:15,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:15,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:15,860 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 133 states. [2020-07-29 01:19:15,860 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 133 states. [2020-07-29 01:19:15,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:15,863 INFO L93 Difference]: Finished difference Result 133 states and 160 transitions. [2020-07-29 01:19:15,863 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 160 transitions. [2020-07-29 01:19:15,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:15,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:15,864 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:15,864 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:15,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-07-29 01:19:15,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 147 transitions. [2020-07-29 01:19:15,867 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 147 transitions. Word has length 23 [2020-07-29 01:19:15,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:15,867 INFO L479 AbstractCegarLoop]: Abstraction has 120 states and 147 transitions. [2020-07-29 01:19:15,867 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-29 01:19:15,867 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 147 transitions. [2020-07-29 01:19:15,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-29 01:19:15,868 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:15,868 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, 1, 1] [2020-07-29 01:19:15,868 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-07-29 01:19:15,869 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:19:15,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:15,869 INFO L82 PathProgramCache]: Analyzing trace with hash 968735281, now seen corresponding path program 1 times [2020-07-29 01:19:15,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:15,870 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541941444] [2020-07-29 01:19:15,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:15,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:16,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:16,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:16,053 INFO L280 TraceCheckUtils]: 0: Hoare triple {9369#(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; {9358#true} is VALID [2020-07-29 01:19:16,054 INFO L280 TraceCheckUtils]: 1: Hoare triple {9358#true} assume true; {9358#true} is VALID [2020-07-29 01:19:16,054 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {9358#true} {9358#true} #204#return; {9358#true} is VALID [2020-07-29 01:19:16,055 INFO L263 TraceCheckUtils]: 0: Hoare triple {9358#true} call ULTIMATE.init(); {9369#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:16,056 INFO L280 TraceCheckUtils]: 1: Hoare triple {9369#(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; {9358#true} is VALID [2020-07-29 01:19:16,056 INFO L280 TraceCheckUtils]: 2: Hoare triple {9358#true} assume true; {9358#true} is VALID [2020-07-29 01:19:16,056 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {9358#true} {9358#true} #204#return; {9358#true} is VALID [2020-07-29 01:19:16,057 INFO L263 TraceCheckUtils]: 4: Hoare triple {9358#true} call #t~ret18 := main(); {9358#true} is VALID [2020-07-29 01:19:16,058 INFO L280 TraceCheckUtils]: 5: Hoare triple {9358#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {9363#(and (<= (+ main_~head~0.base 1) |#StackHeapBarrier|) (= 0 main_~head~0.offset))} is VALID [2020-07-29 01:19:16,060 INFO L280 TraceCheckUtils]: 6: Hoare triple {9363#(and (<= (+ main_~head~0.base 1) |#StackHeapBarrier|) (= 0 main_~head~0.offset))} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset, 4); srcloc: L987 {9364#(and (<= (+ (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 1) |#StackHeapBarrier|) (= 0 main_~head~0.offset))} is VALID [2020-07-29 01:19:16,063 INFO L280 TraceCheckUtils]: 7: Hoare triple {9364#(and (<= (+ (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 1) |#StackHeapBarrier|) (= 0 main_~head~0.offset))} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L987-1 {9364#(and (<= (+ (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 1) |#StackHeapBarrier|) (= 0 main_~head~0.offset))} is VALID [2020-07-29 01:19:16,064 INFO L280 TraceCheckUtils]: 8: Hoare triple {9364#(and (<= (+ (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 1) |#StackHeapBarrier|) (= 0 main_~head~0.offset))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;~state~0 := 1; {9365#(and (<= (+ (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) 1) |#StackHeapBarrier|) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)))} is VALID [2020-07-29 01:19:16,065 INFO L280 TraceCheckUtils]: 9: Hoare triple {9365#(and (<= (+ (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) 1) |#StackHeapBarrier|) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {9365#(and (<= (+ (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) 1) |#StackHeapBarrier|) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)))} is VALID [2020-07-29 01:19:16,067 INFO L280 TraceCheckUtils]: 10: Hoare triple {9365#(and (<= (+ (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) 1) |#StackHeapBarrier|) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)))} assume !(0 != #t~nondet1);havoc #t~nondet1; {9365#(and (<= (+ (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) 1) |#StackHeapBarrier|) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)))} is VALID [2020-07-29 01:19:16,069 INFO L280 TraceCheckUtils]: 11: Hoare triple {9365#(and (<= (+ (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) 1) |#StackHeapBarrier|) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)))} SUMMARY for call write~int(~state~0, ~x~0.base, 8 + ~x~0.offset, 4); srcloc: L994-3 {9366#(<= (+ (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:19:16,070 INFO L280 TraceCheckUtils]: 12: Hoare triple {9366#(<= (+ (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 1) |#StackHeapBarrier|)} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); srcloc: L1016 {9366#(<= (+ (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:19:16,071 INFO L280 TraceCheckUtils]: 13: Hoare triple {9366#(<= (+ (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 1) |#StackHeapBarrier|)} ~x~0.base, ~x~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {9366#(<= (+ (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:19:16,072 INFO L280 TraceCheckUtils]: 14: Hoare triple {9366#(<= (+ (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 1) |#StackHeapBarrier|)} assume !!(0 != ~x~0.base || 0 != ~x~0.offset); {9366#(<= (+ (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:19:16,073 INFO L280 TraceCheckUtils]: 15: Hoare triple {9366#(<= (+ (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 1) |#StackHeapBarrier|)} goto; {9366#(<= (+ (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:19:16,074 INFO L280 TraceCheckUtils]: 16: Hoare triple {9366#(<= (+ (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 1) |#StackHeapBarrier|)} SUMMARY for call #t~mem7 := read~int(~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1021-2 {9366#(<= (+ (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:19:16,074 INFO L280 TraceCheckUtils]: 17: Hoare triple {9366#(<= (+ (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 1) |#StackHeapBarrier|)} assume !(0 != #t~mem7);havoc #t~mem7; {9366#(<= (+ (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:19:16,076 INFO L280 TraceCheckUtils]: 18: Hoare triple {9366#(<= (+ (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 1) |#StackHeapBarrier|)} SUMMARY for call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); srcloc: L1021-3 {9367#(<= (+ |main_#t~mem15.base| 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:19:16,077 INFO L280 TraceCheckUtils]: 19: Hoare triple {9367#(<= (+ |main_#t~mem15.base| 1) |#StackHeapBarrier|)} ~x~0.base, ~x~0.offset := #t~mem15.base, #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; {9368#(<= (+ main_~x~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:19:16,078 INFO L280 TraceCheckUtils]: 20: Hoare triple {9368#(<= (+ main_~x~0.base 1) |#StackHeapBarrier|)} SUMMARY for call #t~mem16 := read~int(~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1029-3 {9368#(<= (+ main_~x~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:19:16,079 INFO L280 TraceCheckUtils]: 21: Hoare triple {9368#(<= (+ main_~x~0.base 1) |#StackHeapBarrier|)} assume !(0 != #t~mem16);havoc #t~mem16; {9368#(<= (+ main_~x~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:19:16,079 INFO L280 TraceCheckUtils]: 22: Hoare triple {9368#(<= (+ main_~x~0.base 1) |#StackHeapBarrier|)} assume 0 == ~x~0.offset; {9368#(<= (+ main_~x~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:19:16,080 INFO L280 TraceCheckUtils]: 23: Hoare triple {9368#(<= (+ main_~x~0.base 1) |#StackHeapBarrier|)} assume !(~x~0.base < #StackHeapBarrier); {9359#false} is VALID [2020-07-29 01:19:16,084 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:16,084 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541941444] [2020-07-29 01:19:16,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:16,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-29 01:19:16,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509015889] [2020-07-29 01:19:16,086 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2020-07-29 01:19:16,086 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:16,086 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 01:19:16,127 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:16,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-29 01:19:16,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:16,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-29 01:19:16,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:19:16,127 INFO L87 Difference]: Start difference. First operand 120 states and 147 transitions. Second operand 9 states. [2020-07-29 01:19:17,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:17,488 INFO L93 Difference]: Finished difference Result 152 states and 166 transitions. [2020-07-29 01:19:17,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-29 01:19:17,489 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2020-07-29 01:19:17,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:17,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 01:19:17,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 149 transitions. [2020-07-29 01:19:17,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 01:19:17,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 149 transitions. [2020-07-29 01:19:17,492 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 149 transitions. [2020-07-29 01:19:17,720 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:17,723 INFO L225 Difference]: With dead ends: 152 [2020-07-29 01:19:17,723 INFO L226 Difference]: Without dead ends: 152 [2020-07-29 01:19:17,724 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2020-07-29 01:19:17,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-07-29 01:19:17,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 121. [2020-07-29 01:19:17,728 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:17,728 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand 121 states. [2020-07-29 01:19:17,728 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand 121 states. [2020-07-29 01:19:17,728 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 121 states. [2020-07-29 01:19:17,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:17,731 INFO L93 Difference]: Finished difference Result 152 states and 166 transitions. [2020-07-29 01:19:17,731 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 166 transitions. [2020-07-29 01:19:17,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:17,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:17,732 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 152 states. [2020-07-29 01:19:17,732 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 152 states. [2020-07-29 01:19:17,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:17,735 INFO L93 Difference]: Finished difference Result 152 states and 166 transitions. [2020-07-29 01:19:17,736 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 166 transitions. [2020-07-29 01:19:17,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:17,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:17,737 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:17,737 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:17,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-07-29 01:19:17,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 148 transitions. [2020-07-29 01:19:17,739 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 148 transitions. Word has length 24 [2020-07-29 01:19:17,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:17,740 INFO L479 AbstractCegarLoop]: Abstraction has 121 states and 148 transitions. [2020-07-29 01:19:17,740 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-29 01:19:17,740 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 148 transitions. [2020-07-29 01:19:17,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-29 01:19:17,741 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:17,741 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, 1, 1] [2020-07-29 01:19:17,741 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-07-29 01:19:17,742 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:19:17,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:17,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1412435069, now seen corresponding path program 1 times [2020-07-29 01:19:17,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:17,743 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287156612] [2020-07-29 01:19:17,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:17,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:18,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:18,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:18,181 INFO L280 TraceCheckUtils]: 0: Hoare triple {9974#(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; {9959#true} is VALID [2020-07-29 01:19:18,182 INFO L280 TraceCheckUtils]: 1: Hoare triple {9959#true} assume true; {9959#true} is VALID [2020-07-29 01:19:18,182 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {9959#true} {9959#true} #204#return; {9959#true} is VALID [2020-07-29 01:19:18,183 INFO L263 TraceCheckUtils]: 0: Hoare triple {9959#true} call ULTIMATE.init(); {9974#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:18,183 INFO L280 TraceCheckUtils]: 1: Hoare triple {9974#(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; {9959#true} is VALID [2020-07-29 01:19:18,183 INFO L280 TraceCheckUtils]: 2: Hoare triple {9959#true} assume true; {9959#true} is VALID [2020-07-29 01:19:18,184 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {9959#true} {9959#true} #204#return; {9959#true} is VALID [2020-07-29 01:19:18,184 INFO L263 TraceCheckUtils]: 4: Hoare triple {9959#true} call #t~ret18 := main(); {9959#true} is VALID [2020-07-29 01:19:18,185 INFO L280 TraceCheckUtils]: 5: Hoare triple {9959#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {9964#(= 0 main_~head~0.offset)} is VALID [2020-07-29 01:19:18,186 INFO L280 TraceCheckUtils]: 6: Hoare triple {9964#(= 0 main_~head~0.offset)} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset, 4); srcloc: L987 {9965#(and (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) main_~head~0.offset) (= 0 main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base))} is VALID [2020-07-29 01:19:18,188 INFO L280 TraceCheckUtils]: 7: Hoare triple {9965#(and (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) main_~head~0.offset) (= 0 main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base))} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L987-1 {9965#(and (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) main_~head~0.offset) (= 0 main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base))} is VALID [2020-07-29 01:19:18,189 INFO L280 TraceCheckUtils]: 8: Hoare triple {9965#(and (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) main_~head~0.offset) (= 0 main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;~state~0 := 1; {9966#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) main_~head~0.base))} is VALID [2020-07-29 01:19:18,191 INFO L280 TraceCheckUtils]: 9: Hoare triple {9966#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) main_~head~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {9966#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) main_~head~0.base))} is VALID [2020-07-29 01:19:18,192 INFO L280 TraceCheckUtils]: 10: Hoare triple {9966#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) main_~head~0.base))} assume !(0 != #t~nondet1);havoc #t~nondet1; {9966#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) main_~head~0.base))} is VALID [2020-07-29 01:19:18,194 INFO L280 TraceCheckUtils]: 11: Hoare triple {9966#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) main_~head~0.base))} SUMMARY for call write~int(~state~0, ~x~0.base, 8 + ~x~0.offset, 4); srcloc: L994-3 {9965#(and (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) main_~head~0.offset) (= 0 main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base))} is VALID [2020-07-29 01:19:18,195 INFO L280 TraceCheckUtils]: 12: Hoare triple {9965#(and (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) main_~head~0.offset) (= 0 main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base))} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); srcloc: L1016 {9967#(and (= 0 |main_#t~mem6.offset|) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| |main_#t~mem6.base|) |main_#t~mem6.offset|)) (= (select (select |#memory_$Pointer$.offset| |main_#t~mem6.base|) |main_#t~mem6.offset|) 0))} is VALID [2020-07-29 01:19:18,197 INFO L280 TraceCheckUtils]: 13: Hoare triple {9967#(and (= 0 |main_#t~mem6.offset|) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| |main_#t~mem6.base|) |main_#t~mem6.offset|)) (= (select (select |#memory_$Pointer$.offset| |main_#t~mem6.base|) |main_#t~mem6.offset|) 0))} ~x~0.base, ~x~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {9968#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base) (= main_~x~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-29 01:19:18,198 INFO L280 TraceCheckUtils]: 14: Hoare triple {9968#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base) (= main_~x~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} assume !!(0 != ~x~0.base || 0 != ~x~0.offset); {9968#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base) (= main_~x~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-29 01:19:18,200 INFO L280 TraceCheckUtils]: 15: Hoare triple {9968#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base) (= main_~x~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} goto; {9968#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base) (= main_~x~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-29 01:19:18,206 INFO L280 TraceCheckUtils]: 16: Hoare triple {9968#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base) (= main_~x~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} SUMMARY for call #t~mem7 := read~int(~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1021-2 {9969#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) |main_#t~mem7|) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base) (= main_~x~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-29 01:19:18,207 INFO L280 TraceCheckUtils]: 17: Hoare triple {9969#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) |main_#t~mem7|) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base) (= main_~x~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} assume !!(0 != #t~mem7);havoc #t~mem7; {9970#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base) (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))) (= main_~x~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-29 01:19:18,209 INFO L280 TraceCheckUtils]: 18: Hoare triple {9970#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base) (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))) (= main_~x~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} SUMMARY for call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1023-13 {9971#(not (= 0 (select (select |#memory_int| |main_#t~mem8.base|) (+ |main_#t~mem8.offset| 8))))} is VALID [2020-07-29 01:19:18,210 INFO L280 TraceCheckUtils]: 19: Hoare triple {9971#(not (= 0 (select (select |#memory_int| |main_#t~mem8.base|) (+ |main_#t~mem8.offset| 8))))} SUMMARY for call #t~mem9 := read~int(#t~mem8.base, 8 + #t~mem8.offset, 4); srcloc: L1023-1 {9972#(not (= 0 |main_#t~mem9|))} is VALID [2020-07-29 01:19:18,212 INFO L280 TraceCheckUtils]: 20: Hoare triple {9972#(not (= 0 |main_#t~mem9|))} #t~short13 := 0 != #t~mem9; {9973#|main_#t~short13|} is VALID [2020-07-29 01:19:18,213 INFO L280 TraceCheckUtils]: 21: Hoare triple {9973#|main_#t~short13|} assume !#t~short13; {9960#false} is VALID [2020-07-29 01:19:18,213 INFO L280 TraceCheckUtils]: 22: Hoare triple {9960#false} assume !#t~short13;havoc #t~mem9;havoc #t~mem10.base, #t~mem10.offset;havoc #t~mem12;havoc #t~short13;havoc #t~mem8.base, #t~mem8.offset;havoc #t~mem11; {9960#false} is VALID [2020-07-29 01:19:18,213 INFO L280 TraceCheckUtils]: 23: Hoare triple {9960#false} assume !false; {9960#false} is VALID [2020-07-29 01:19:18,218 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:18,218 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287156612] [2020-07-29 01:19:18,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:18,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-29 01:19:18,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440284352] [2020-07-29 01:19:18,219 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2020-07-29 01:19:18,221 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:18,221 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-29 01:19:18,257 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:18,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-29 01:19:18,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:18,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-29 01:19:18,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2020-07-29 01:19:18,258 INFO L87 Difference]: Start difference. First operand 121 states and 148 transitions. Second operand 13 states. [2020-07-29 01:19:20,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:20,082 INFO L93 Difference]: Finished difference Result 144 states and 155 transitions. [2020-07-29 01:19:20,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-29 01:19:20,082 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2020-07-29 01:19:20,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:20,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-29 01:19:20,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 153 transitions. [2020-07-29 01:19:20,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-29 01:19:20,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 153 transitions. [2020-07-29 01:19:20,086 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 153 transitions. [2020-07-29 01:19:20,307 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:20,309 INFO L225 Difference]: With dead ends: 144 [2020-07-29 01:19:20,310 INFO L226 Difference]: Without dead ends: 144 [2020-07-29 01:19:20,310 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2020-07-29 01:19:20,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-07-29 01:19:20,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 121. [2020-07-29 01:19:20,314 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:20,314 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand 121 states. [2020-07-29 01:19:20,314 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand 121 states. [2020-07-29 01:19:20,315 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 121 states. [2020-07-29 01:19:20,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:20,318 INFO L93 Difference]: Finished difference Result 144 states and 155 transitions. [2020-07-29 01:19:20,318 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 155 transitions. [2020-07-29 01:19:20,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:20,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:20,319 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 144 states. [2020-07-29 01:19:20,319 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 144 states. [2020-07-29 01:19:20,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:20,322 INFO L93 Difference]: Finished difference Result 144 states and 155 transitions. [2020-07-29 01:19:20,322 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 155 transitions. [2020-07-29 01:19:20,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:20,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:20,323 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:20,324 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:20,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-07-29 01:19:20,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 147 transitions. [2020-07-29 01:19:20,326 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 147 transitions. Word has length 24 [2020-07-29 01:19:20,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:20,326 INFO L479 AbstractCegarLoop]: Abstraction has 121 states and 147 transitions. [2020-07-29 01:19:20,327 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-29 01:19:20,327 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 147 transitions. [2020-07-29 01:19:20,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-29 01:19:20,328 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:20,328 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, 1, 1, 1] [2020-07-29 01:19:20,328 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-07-29 01:19:20,329 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:19:20,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:20,329 INFO L82 PathProgramCache]: Analyzing trace with hash -33931422, now seen corresponding path program 1 times [2020-07-29 01:19:20,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:20,330 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524433333] [2020-07-29 01:19:20,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:20,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:20,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:20,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:20,512 INFO L280 TraceCheckUtils]: 0: Hoare triple {10561#(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; {10550#true} is VALID [2020-07-29 01:19:20,513 INFO L280 TraceCheckUtils]: 1: Hoare triple {10550#true} assume true; {10550#true} is VALID [2020-07-29 01:19:20,513 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {10550#true} {10550#true} #204#return; {10550#true} is VALID [2020-07-29 01:19:20,515 INFO L263 TraceCheckUtils]: 0: Hoare triple {10550#true} call ULTIMATE.init(); {10561#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:20,515 INFO L280 TraceCheckUtils]: 1: Hoare triple {10561#(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; {10550#true} is VALID [2020-07-29 01:19:20,515 INFO L280 TraceCheckUtils]: 2: Hoare triple {10550#true} assume true; {10550#true} is VALID [2020-07-29 01:19:20,516 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {10550#true} {10550#true} #204#return; {10550#true} is VALID [2020-07-29 01:19:20,516 INFO L263 TraceCheckUtils]: 4: Hoare triple {10550#true} call #t~ret18 := main(); {10550#true} is VALID [2020-07-29 01:19:20,518 INFO L280 TraceCheckUtils]: 5: Hoare triple {10550#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {10555#(= 0 main_~head~0.offset)} is VALID [2020-07-29 01:19:20,520 INFO L280 TraceCheckUtils]: 6: Hoare triple {10555#(= 0 main_~head~0.offset)} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset, 4); srcloc: L987 {10556#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 0 main_~head~0.offset))} is VALID [2020-07-29 01:19:20,521 INFO L280 TraceCheckUtils]: 7: Hoare triple {10556#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 0 main_~head~0.offset))} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L987-1 {10556#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 0 main_~head~0.offset))} is VALID [2020-07-29 01:19:20,523 INFO L280 TraceCheckUtils]: 8: Hoare triple {10556#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 0 main_~head~0.offset))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;~state~0 := 1; {10557#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)))} is VALID [2020-07-29 01:19:20,524 INFO L280 TraceCheckUtils]: 9: Hoare triple {10557#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {10557#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)))} is VALID [2020-07-29 01:19:20,525 INFO L280 TraceCheckUtils]: 10: Hoare triple {10557#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)))} assume !(0 != #t~nondet1);havoc #t~nondet1; {10557#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)))} is VALID [2020-07-29 01:19:20,528 INFO L280 TraceCheckUtils]: 11: Hoare triple {10557#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)))} SUMMARY for call write~int(~state~0, ~x~0.base, 8 + ~x~0.offset, 4); srcloc: L994-3 {10558#(= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))} is VALID [2020-07-29 01:19:20,529 INFO L280 TraceCheckUtils]: 12: Hoare triple {10558#(= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); srcloc: L1016 {10558#(= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))} is VALID [2020-07-29 01:19:20,530 INFO L280 TraceCheckUtils]: 13: Hoare triple {10558#(= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))} ~x~0.base, ~x~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {10558#(= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))} is VALID [2020-07-29 01:19:20,532 INFO L280 TraceCheckUtils]: 14: Hoare triple {10558#(= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))} assume !!(0 != ~x~0.base || 0 != ~x~0.offset); {10558#(= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))} is VALID [2020-07-29 01:19:20,533 INFO L280 TraceCheckUtils]: 15: Hoare triple {10558#(= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))} goto; {10558#(= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))} is VALID [2020-07-29 01:19:20,533 INFO L280 TraceCheckUtils]: 16: Hoare triple {10558#(= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))} SUMMARY for call #t~mem7 := read~int(~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1021-2 {10558#(= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))} is VALID [2020-07-29 01:19:20,534 INFO L280 TraceCheckUtils]: 17: Hoare triple {10558#(= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))} assume !(0 != #t~mem7);havoc #t~mem7; {10558#(= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))} is VALID [2020-07-29 01:19:20,536 INFO L280 TraceCheckUtils]: 18: Hoare triple {10558#(= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))} SUMMARY for call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); srcloc: L1021-3 {10559#(= 0 |main_#t~mem15.offset|)} is VALID [2020-07-29 01:19:20,537 INFO L280 TraceCheckUtils]: 19: Hoare triple {10559#(= 0 |main_#t~mem15.offset|)} ~x~0.base, ~x~0.offset := #t~mem15.base, #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; {10560#(= main_~x~0.offset 0)} is VALID [2020-07-29 01:19:20,538 INFO L280 TraceCheckUtils]: 20: Hoare triple {10560#(= main_~x~0.offset 0)} SUMMARY for call #t~mem16 := read~int(~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1029-3 {10560#(= main_~x~0.offset 0)} is VALID [2020-07-29 01:19:20,539 INFO L280 TraceCheckUtils]: 21: Hoare triple {10560#(= main_~x~0.offset 0)} assume !!(0 != #t~mem16);havoc #t~mem16;~head~0.base, ~head~0.offset := ~x~0.base, ~x~0.offset; {10555#(= 0 main_~head~0.offset)} is VALID [2020-07-29 01:19:20,540 INFO L280 TraceCheckUtils]: 22: Hoare triple {10555#(= 0 main_~head~0.offset)} SUMMARY for call #t~mem17.base, #t~mem17.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1032 {10555#(= 0 main_~head~0.offset)} is VALID [2020-07-29 01:19:20,541 INFO L280 TraceCheckUtils]: 23: Hoare triple {10555#(= 0 main_~head~0.offset)} ~x~0.base, ~x~0.offset := #t~mem17.base, #t~mem17.offset;havoc #t~mem17.base, #t~mem17.offset; {10555#(= 0 main_~head~0.offset)} is VALID [2020-07-29 01:19:20,542 INFO L280 TraceCheckUtils]: 24: Hoare triple {10555#(= 0 main_~head~0.offset)} assume !(0 == ~head~0.offset); {10551#false} is VALID [2020-07-29 01:19:20,544 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:20,544 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524433333] [2020-07-29 01:19:20,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:20,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-29 01:19:20,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845944298] [2020-07-29 01:19:20,546 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-07-29 01:19:20,546 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:20,546 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 01:19:20,585 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:20,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-29 01:19:20,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:20,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-29 01:19:20,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:19:20,586 INFO L87 Difference]: Start difference. First operand 121 states and 147 transitions. Second operand 9 states. [2020-07-29 01:19:21,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:21,633 INFO L93 Difference]: Finished difference Result 144 states and 158 transitions. [2020-07-29 01:19:21,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-29 01:19:21,634 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-07-29 01:19:21,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:21,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 01:19:21,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 140 transitions. [2020-07-29 01:19:21,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 01:19:21,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 140 transitions. [2020-07-29 01:19:21,638 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 140 transitions. [2020-07-29 01:19:21,829 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:21,833 INFO L225 Difference]: With dead ends: 144 [2020-07-29 01:19:21,833 INFO L226 Difference]: Without dead ends: 144 [2020-07-29 01:19:21,833 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2020-07-29 01:19:21,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-07-29 01:19:21,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 123. [2020-07-29 01:19:21,837 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:21,837 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand 123 states. [2020-07-29 01:19:21,837 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand 123 states. [2020-07-29 01:19:21,838 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 123 states. [2020-07-29 01:19:21,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:21,840 INFO L93 Difference]: Finished difference Result 144 states and 158 transitions. [2020-07-29 01:19:21,841 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 158 transitions. [2020-07-29 01:19:21,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:21,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:21,842 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 144 states. [2020-07-29 01:19:21,842 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 144 states. [2020-07-29 01:19:21,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:21,845 INFO L93 Difference]: Finished difference Result 144 states and 158 transitions. [2020-07-29 01:19:21,845 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 158 transitions. [2020-07-29 01:19:21,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:21,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:21,846 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:21,846 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:21,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-07-29 01:19:21,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 149 transitions. [2020-07-29 01:19:21,848 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 149 transitions. Word has length 25 [2020-07-29 01:19:21,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:21,849 INFO L479 AbstractCegarLoop]: Abstraction has 123 states and 149 transitions. [2020-07-29 01:19:21,849 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-29 01:19:21,849 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 149 transitions. [2020-07-29 01:19:21,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-29 01:19:21,850 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:21,850 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, 1, 1, 1] [2020-07-29 01:19:21,850 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-07-29 01:19:21,851 INFO L427 AbstractCegarLoop]: === Iteration 21 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:19:21,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:21,851 INFO L82 PathProgramCache]: Analyzing trace with hash 835442004, now seen corresponding path program 1 times [2020-07-29 01:19:21,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:21,852 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970027493] [2020-07-29 01:19:21,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:21,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:21,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:21,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:21,931 INFO L280 TraceCheckUtils]: 0: Hoare triple {11135#(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; {11127#true} is VALID [2020-07-29 01:19:21,931 INFO L280 TraceCheckUtils]: 1: Hoare triple {11127#true} assume true; {11127#true} is VALID [2020-07-29 01:19:21,931 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {11127#true} {11127#true} #204#return; {11127#true} is VALID [2020-07-29 01:19:21,933 INFO L263 TraceCheckUtils]: 0: Hoare triple {11127#true} call ULTIMATE.init(); {11135#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:21,933 INFO L280 TraceCheckUtils]: 1: Hoare triple {11135#(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; {11127#true} is VALID [2020-07-29 01:19:21,933 INFO L280 TraceCheckUtils]: 2: Hoare triple {11127#true} assume true; {11127#true} is VALID [2020-07-29 01:19:21,933 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {11127#true} {11127#true} #204#return; {11127#true} is VALID [2020-07-29 01:19:21,934 INFO L263 TraceCheckUtils]: 4: Hoare triple {11127#true} call #t~ret18 := main(); {11127#true} is VALID [2020-07-29 01:19:21,934 INFO L280 TraceCheckUtils]: 5: Hoare triple {11127#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {11127#true} is VALID [2020-07-29 01:19:21,934 INFO L280 TraceCheckUtils]: 6: Hoare triple {11127#true} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset, 4); srcloc: L987 {11127#true} is VALID [2020-07-29 01:19:21,934 INFO L280 TraceCheckUtils]: 7: Hoare triple {11127#true} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L987-1 {11127#true} is VALID [2020-07-29 01:19:21,934 INFO L280 TraceCheckUtils]: 8: Hoare triple {11127#true} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;~state~0 := 1; {11127#true} is VALID [2020-07-29 01:19:21,935 INFO L280 TraceCheckUtils]: 9: Hoare triple {11127#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {11127#true} is VALID [2020-07-29 01:19:21,935 INFO L280 TraceCheckUtils]: 10: Hoare triple {11127#true} assume !(0 != #t~nondet1);havoc #t~nondet1; {11127#true} is VALID [2020-07-29 01:19:21,935 INFO L280 TraceCheckUtils]: 11: Hoare triple {11127#true} SUMMARY for call write~int(~state~0, ~x~0.base, 8 + ~x~0.offset, 4); srcloc: L994-3 {11127#true} is VALID [2020-07-29 01:19:21,936 INFO L280 TraceCheckUtils]: 12: Hoare triple {11127#true} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); srcloc: L1016 {11127#true} is VALID [2020-07-29 01:19:21,936 INFO L280 TraceCheckUtils]: 13: Hoare triple {11127#true} ~x~0.base, ~x~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {11127#true} is VALID [2020-07-29 01:19:21,936 INFO L280 TraceCheckUtils]: 14: Hoare triple {11127#true} assume !!(0 != ~x~0.base || 0 != ~x~0.offset); {11127#true} is VALID [2020-07-29 01:19:21,936 INFO L280 TraceCheckUtils]: 15: Hoare triple {11127#true} goto; {11127#true} is VALID [2020-07-29 01:19:21,937 INFO L280 TraceCheckUtils]: 16: Hoare triple {11127#true} SUMMARY for call #t~mem7 := read~int(~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1021-2 {11127#true} is VALID [2020-07-29 01:19:21,937 INFO L280 TraceCheckUtils]: 17: Hoare triple {11127#true} assume !!(0 != #t~mem7);havoc #t~mem7; {11127#true} is VALID [2020-07-29 01:19:21,939 INFO L280 TraceCheckUtils]: 18: Hoare triple {11127#true} SUMMARY for call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1023-13 {11132#(= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_#t~mem8.base|)} is VALID [2020-07-29 01:19:21,940 INFO L280 TraceCheckUtils]: 19: Hoare triple {11132#(= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_#t~mem8.base|)} SUMMARY for call #t~mem9 := read~int(#t~mem8.base, 8 + #t~mem8.offset, 4); srcloc: L1023-1 {11133#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-29 01:19:21,947 INFO L280 TraceCheckUtils]: 20: Hoare triple {11133#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} #t~short13 := 0 != #t~mem9; {11133#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-29 01:19:21,947 INFO L280 TraceCheckUtils]: 21: Hoare triple {11133#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} assume #t~short13; {11133#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-29 01:19:21,948 INFO L280 TraceCheckUtils]: 22: Hoare triple {11133#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} SUMMARY for call #t~mem11 := read~int(~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1023-4 {11133#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-29 01:19:21,949 INFO L280 TraceCheckUtils]: 23: Hoare triple {11133#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} SUMMARY for call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1023-5 {11134#(= (select |#valid| |main_#t~mem10.base|) 1)} is VALID [2020-07-29 01:19:21,950 INFO L280 TraceCheckUtils]: 24: Hoare triple {11134#(= (select |#valid| |main_#t~mem10.base|) 1)} assume !(1 == #valid[#t~mem10.base]); {11128#false} is VALID [2020-07-29 01:19:21,951 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:21,951 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970027493] [2020-07-29 01:19:21,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:21,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 01:19:21,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457490811] [2020-07-29 01:19:21,953 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-07-29 01:19:21,953 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:21,953 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:19:21,980 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:21,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-29 01:19:21,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:21,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:19:21,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:19:21,982 INFO L87 Difference]: Start difference. First operand 123 states and 149 transitions. Second operand 6 states. [2020-07-29 01:19:22,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:22,576 INFO L93 Difference]: Finished difference Result 124 states and 150 transitions. [2020-07-29 01:19:22,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 01:19:22,576 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-07-29 01:19:22,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:22,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:19:22,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2020-07-29 01:19:22,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:19:22,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2020-07-29 01:19:22,579 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 87 transitions. [2020-07-29 01:19:22,709 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:22,711 INFO L225 Difference]: With dead ends: 124 [2020-07-29 01:19:22,711 INFO L226 Difference]: Without dead ends: 124 [2020-07-29 01:19:22,712 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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:22,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2020-07-29 01:19:22,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2020-07-29 01:19:22,716 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:22,716 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand 122 states. [2020-07-29 01:19:22,716 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand 122 states. [2020-07-29 01:19:22,716 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 122 states. [2020-07-29 01:19:22,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:22,719 INFO L93 Difference]: Finished difference Result 124 states and 150 transitions. [2020-07-29 01:19:22,719 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 150 transitions. [2020-07-29 01:19:22,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:22,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:22,720 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 124 states. [2020-07-29 01:19:22,720 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 124 states. [2020-07-29 01:19:22,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:22,722 INFO L93 Difference]: Finished difference Result 124 states and 150 transitions. [2020-07-29 01:19:22,723 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 150 transitions. [2020-07-29 01:19:22,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:22,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:22,724 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:22,724 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:22,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-07-29 01:19:22,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 146 transitions. [2020-07-29 01:19:22,726 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 146 transitions. Word has length 25 [2020-07-29 01:19:22,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:22,727 INFO L479 AbstractCegarLoop]: Abstraction has 122 states and 146 transitions. [2020-07-29 01:19:22,727 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-29 01:19:22,727 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 146 transitions. [2020-07-29 01:19:22,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-29 01:19:22,728 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:22,728 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, 1, 1, 1] [2020-07-29 01:19:22,728 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-07-29 01:19:22,729 INFO L427 AbstractCegarLoop]: === Iteration 22 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:19:22,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:22,729 INFO L82 PathProgramCache]: Analyzing trace with hash 835442005, now seen corresponding path program 1 times [2020-07-29 01:19:22,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:22,729 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103812446] [2020-07-29 01:19:22,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:22,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:22,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:22,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:22,973 INFO L280 TraceCheckUtils]: 0: Hoare triple {11649#(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; {11636#true} is VALID [2020-07-29 01:19:22,974 INFO L280 TraceCheckUtils]: 1: Hoare triple {11636#true} assume true; {11636#true} is VALID [2020-07-29 01:19:22,974 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {11636#true} {11636#true} #204#return; {11636#true} is VALID [2020-07-29 01:19:22,975 INFO L263 TraceCheckUtils]: 0: Hoare triple {11636#true} call ULTIMATE.init(); {11649#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:22,975 INFO L280 TraceCheckUtils]: 1: Hoare triple {11649#(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; {11636#true} is VALID [2020-07-29 01:19:22,975 INFO L280 TraceCheckUtils]: 2: Hoare triple {11636#true} assume true; {11636#true} is VALID [2020-07-29 01:19:22,975 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {11636#true} {11636#true} #204#return; {11636#true} is VALID [2020-07-29 01:19:22,975 INFO L263 TraceCheckUtils]: 4: Hoare triple {11636#true} call #t~ret18 := main(); {11636#true} is VALID [2020-07-29 01:19:22,976 INFO L280 TraceCheckUtils]: 5: Hoare triple {11636#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {11641#(= 0 main_~head~0.offset)} is VALID [2020-07-29 01:19:22,977 INFO L280 TraceCheckUtils]: 6: Hoare triple {11641#(= 0 main_~head~0.offset)} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset, 4); srcloc: L987 {11642#(and (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) main_~head~0.offset) (= 0 main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base))} is VALID [2020-07-29 01:19:22,978 INFO L280 TraceCheckUtils]: 7: Hoare triple {11642#(and (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) main_~head~0.offset) (= 0 main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base))} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L987-1 {11642#(and (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) main_~head~0.offset) (= 0 main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base))} is VALID [2020-07-29 01:19:22,979 INFO L280 TraceCheckUtils]: 8: Hoare triple {11642#(and (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) main_~head~0.offset) (= 0 main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;~state~0 := 1; {11643#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) main_~head~0.base))} is VALID [2020-07-29 01:19:22,981 INFO L280 TraceCheckUtils]: 9: Hoare triple {11643#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) main_~head~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {11643#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) main_~head~0.base))} is VALID [2020-07-29 01:19:22,982 INFO L280 TraceCheckUtils]: 10: Hoare triple {11643#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) main_~head~0.base))} assume !(0 != #t~nondet1);havoc #t~nondet1; {11643#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) main_~head~0.base))} is VALID [2020-07-29 01:19:22,984 INFO L280 TraceCheckUtils]: 11: Hoare triple {11643#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) main_~head~0.base))} SUMMARY for call write~int(~state~0, ~x~0.base, 8 + ~x~0.offset, 4); srcloc: L994-3 {11642#(and (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) main_~head~0.offset) (= 0 main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base))} is VALID [2020-07-29 01:19:22,985 INFO L280 TraceCheckUtils]: 12: Hoare triple {11642#(and (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) main_~head~0.offset) (= 0 main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base))} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); srcloc: L1016 {11644#(= (select (select |#memory_$Pointer$.offset| |main_#t~mem6.base|) |main_#t~mem6.offset|) 0)} is VALID [2020-07-29 01:19:22,986 INFO L280 TraceCheckUtils]: 13: Hoare triple {11644#(= (select (select |#memory_$Pointer$.offset| |main_#t~mem6.base|) |main_#t~mem6.offset|) 0)} ~x~0.base, ~x~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {11645#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))} is VALID [2020-07-29 01:19:22,986 INFO L280 TraceCheckUtils]: 14: Hoare triple {11645#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))} assume !!(0 != ~x~0.base || 0 != ~x~0.offset); {11645#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))} is VALID [2020-07-29 01:19:22,987 INFO L280 TraceCheckUtils]: 15: Hoare triple {11645#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))} goto; {11645#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))} is VALID [2020-07-29 01:19:22,988 INFO L280 TraceCheckUtils]: 16: Hoare triple {11645#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))} SUMMARY for call #t~mem7 := read~int(~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1021-2 {11645#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))} is VALID [2020-07-29 01:19:22,989 INFO L280 TraceCheckUtils]: 17: Hoare triple {11645#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))} assume !!(0 != #t~mem7);havoc #t~mem7; {11645#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))} is VALID [2020-07-29 01:19:22,990 INFO L280 TraceCheckUtils]: 18: Hoare triple {11645#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))} SUMMARY for call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1023-13 {11646#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_#t~mem8.base|) (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) |main_#t~mem8.offset|) (= 0 |main_#t~mem8.offset|))} is VALID [2020-07-29 01:19:22,991 INFO L280 TraceCheckUtils]: 19: Hoare triple {11646#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_#t~mem8.base|) (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) |main_#t~mem8.offset|) (= 0 |main_#t~mem8.offset|))} SUMMARY for call #t~mem9 := read~int(#t~mem8.base, 8 + #t~mem8.offset, 4); srcloc: L1023-1 {11647#(and (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 12) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} is VALID [2020-07-29 01:19:22,992 INFO L280 TraceCheckUtils]: 20: Hoare triple {11647#(and (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 12) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} #t~short13 := 0 != #t~mem9; {11647#(and (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 12) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} is VALID [2020-07-29 01:19:22,993 INFO L280 TraceCheckUtils]: 21: Hoare triple {11647#(and (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 12) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} assume #t~short13; {11647#(and (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 12) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} is VALID [2020-07-29 01:19:22,995 INFO L280 TraceCheckUtils]: 22: Hoare triple {11647#(and (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 12) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} SUMMARY for call #t~mem11 := read~int(~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1023-4 {11647#(and (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 12) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} is VALID [2020-07-29 01:19:22,996 INFO L280 TraceCheckUtils]: 23: Hoare triple {11647#(and (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 12) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} SUMMARY for call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1023-5 {11648#(and (<= 0 |main_#t~mem10.offset|) (<= (+ |main_#t~mem10.offset| 12) (select |#length| |main_#t~mem10.base|)))} is VALID [2020-07-29 01:19:22,997 INFO L280 TraceCheckUtils]: 24: Hoare triple {11648#(and (<= 0 |main_#t~mem10.offset|) (<= (+ |main_#t~mem10.offset| 12) (select |#length| |main_#t~mem10.base|)))} assume !(4 + (8 + #t~mem10.offset) <= #length[#t~mem10.base] && 0 <= 8 + #t~mem10.offset); {11637#false} is VALID [2020-07-29 01:19:22,998 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:22,999 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103812446] [2020-07-29 01:19:22,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:22,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-29 01:19:22,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509323182] [2020-07-29 01:19:23,000 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-07-29 01:19:23,000 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:23,000 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-29 01:19:23,037 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:23,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-29 01:19:23,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:23,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-29 01:19:23,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-07-29 01:19:23,038 INFO L87 Difference]: Start difference. First operand 122 states and 146 transitions. Second operand 11 states. [2020-07-29 01:19:24,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:24,678 INFO L93 Difference]: Finished difference Result 142 states and 153 transitions. [2020-07-29 01:19:24,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-29 01:19:24,679 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-07-29 01:19:24,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:24,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-29 01:19:24,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 149 transitions. [2020-07-29 01:19:24,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-29 01:19:24,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 149 transitions. [2020-07-29 01:19:24,683 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 149 transitions. [2020-07-29 01:19:24,897 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:24,900 INFO L225 Difference]: With dead ends: 142 [2020-07-29 01:19:24,900 INFO L226 Difference]: Without dead ends: 142 [2020-07-29 01:19:24,901 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2020-07-29 01:19:24,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-07-29 01:19:24,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 122. [2020-07-29 01:19:24,904 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:24,904 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand 122 states. [2020-07-29 01:19:24,904 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 122 states. [2020-07-29 01:19:24,904 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 122 states. [2020-07-29 01:19:24,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:24,907 INFO L93 Difference]: Finished difference Result 142 states and 153 transitions. [2020-07-29 01:19:24,907 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 153 transitions. [2020-07-29 01:19:24,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:24,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:24,908 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 142 states. [2020-07-29 01:19:24,908 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 142 states. [2020-07-29 01:19:24,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:24,911 INFO L93 Difference]: Finished difference Result 142 states and 153 transitions. [2020-07-29 01:19:24,911 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 153 transitions. [2020-07-29 01:19:24,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:24,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:24,912 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:24,913 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:24,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-07-29 01:19:24,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 145 transitions. [2020-07-29 01:19:24,915 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 145 transitions. Word has length 25 [2020-07-29 01:19:24,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:24,916 INFO L479 AbstractCegarLoop]: Abstraction has 122 states and 145 transitions. [2020-07-29 01:19:24,916 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-29 01:19:24,916 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 145 transitions. [2020-07-29 01:19:24,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-29 01:19:24,917 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:24,917 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, 1, 1, 1, 1] [2020-07-29 01:19:24,917 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-07-29 01:19:24,917 INFO L427 AbstractCegarLoop]: === Iteration 23 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:19:24,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:24,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1053290924, now seen corresponding path program 1 times [2020-07-29 01:19:24,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:24,918 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897420761] [2020-07-29 01:19:24,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:24,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:25,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:25,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:25,183 INFO L280 TraceCheckUtils]: 0: Hoare triple {12228#(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; {12216#true} is VALID [2020-07-29 01:19:25,183 INFO L280 TraceCheckUtils]: 1: Hoare triple {12216#true} assume true; {12216#true} is VALID [2020-07-29 01:19:25,183 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {12216#true} {12216#true} #204#return; {12216#true} is VALID [2020-07-29 01:19:25,191 INFO L263 TraceCheckUtils]: 0: Hoare triple {12216#true} call ULTIMATE.init(); {12228#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:25,192 INFO L280 TraceCheckUtils]: 1: Hoare triple {12228#(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; {12216#true} is VALID [2020-07-29 01:19:25,192 INFO L280 TraceCheckUtils]: 2: Hoare triple {12216#true} assume true; {12216#true} is VALID [2020-07-29 01:19:25,192 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {12216#true} {12216#true} #204#return; {12216#true} is VALID [2020-07-29 01:19:25,192 INFO L263 TraceCheckUtils]: 4: Hoare triple {12216#true} call #t~ret18 := main(); {12216#true} is VALID [2020-07-29 01:19:25,193 INFO L280 TraceCheckUtils]: 5: Hoare triple {12216#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {12221#(= 0 main_~head~0.offset)} is VALID [2020-07-29 01:19:25,195 INFO L280 TraceCheckUtils]: 6: Hoare triple {12221#(= 0 main_~head~0.offset)} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset, 4); srcloc: L987 {12222#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 0 main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base))} is VALID [2020-07-29 01:19:25,196 INFO L280 TraceCheckUtils]: 7: Hoare triple {12222#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 0 main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base))} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L987-1 {12222#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 0 main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base))} is VALID [2020-07-29 01:19:25,197 INFO L280 TraceCheckUtils]: 8: Hoare triple {12222#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 0 main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;~state~0 := 1; {12223#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) main_~x~0.base) (= 1 main_~state~0) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= 0 main_~head~0.offset))} is VALID [2020-07-29 01:19:25,198 INFO L280 TraceCheckUtils]: 9: Hoare triple {12223#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) main_~x~0.base) (= 1 main_~state~0) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= 0 main_~head~0.offset))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {12223#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) main_~x~0.base) (= 1 main_~state~0) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= 0 main_~head~0.offset))} is VALID [2020-07-29 01:19:25,199 INFO L280 TraceCheckUtils]: 10: Hoare triple {12223#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) main_~x~0.base) (= 1 main_~state~0) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= 0 main_~head~0.offset))} assume !(0 != #t~nondet1);havoc #t~nondet1; {12223#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) main_~x~0.base) (= 1 main_~state~0) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= 0 main_~head~0.offset))} is VALID [2020-07-29 01:19:25,200 INFO L280 TraceCheckUtils]: 11: Hoare triple {12223#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) main_~x~0.base) (= 1 main_~state~0) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= 0 main_~head~0.offset))} SUMMARY for call write~int(~state~0, ~x~0.base, 8 + ~x~0.offset, 4); srcloc: L994-3 {12224#(and (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 0 main_~head~0.offset))} is VALID [2020-07-29 01:19:25,201 INFO L280 TraceCheckUtils]: 12: Hoare triple {12224#(and (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 0 main_~head~0.offset))} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); srcloc: L1016 {12225#(and (= 0 |main_#t~mem6.offset|) (= 1 (select (select |#memory_int| |main_#t~mem6.base|) 8)))} is VALID [2020-07-29 01:19:25,202 INFO L280 TraceCheckUtils]: 13: Hoare triple {12225#(and (= 0 |main_#t~mem6.offset|) (= 1 (select (select |#memory_int| |main_#t~mem6.base|) 8)))} ~x~0.base, ~x~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {12226#(and (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~x~0.offset 0))} is VALID [2020-07-29 01:19:25,203 INFO L280 TraceCheckUtils]: 14: Hoare triple {12226#(and (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~x~0.offset 0))} assume !!(0 != ~x~0.base || 0 != ~x~0.offset); {12226#(and (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~x~0.offset 0))} is VALID [2020-07-29 01:19:25,204 INFO L280 TraceCheckUtils]: 15: Hoare triple {12226#(and (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~x~0.offset 0))} goto; {12226#(and (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~x~0.offset 0))} is VALID [2020-07-29 01:19:25,204 INFO L280 TraceCheckUtils]: 16: Hoare triple {12226#(and (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~x~0.offset 0))} SUMMARY for call #t~mem7 := read~int(~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1021-2 {12227#(= 1 |main_#t~mem7|)} is VALID [2020-07-29 01:19:25,205 INFO L280 TraceCheckUtils]: 17: Hoare triple {12227#(= 1 |main_#t~mem7|)} assume !(0 != #t~mem7);havoc #t~mem7; {12217#false} is VALID [2020-07-29 01:19:25,205 INFO L280 TraceCheckUtils]: 18: Hoare triple {12217#false} SUMMARY for call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); srcloc: L1021-3 {12217#false} is VALID [2020-07-29 01:19:25,205 INFO L280 TraceCheckUtils]: 19: Hoare triple {12217#false} ~x~0.base, ~x~0.offset := #t~mem15.base, #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; {12217#false} is VALID [2020-07-29 01:19:25,205 INFO L280 TraceCheckUtils]: 20: Hoare triple {12217#false} SUMMARY for call #t~mem16 := read~int(~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1029-3 {12217#false} is VALID [2020-07-29 01:19:25,205 INFO L280 TraceCheckUtils]: 21: Hoare triple {12217#false} assume !(0 != #t~mem16);havoc #t~mem16; {12217#false} is VALID [2020-07-29 01:19:25,205 INFO L280 TraceCheckUtils]: 22: Hoare triple {12217#false} assume 0 == ~x~0.offset; {12217#false} is VALID [2020-07-29 01:19:25,206 INFO L280 TraceCheckUtils]: 23: Hoare triple {12217#false} assume ~x~0.base < #StackHeapBarrier; {12217#false} is VALID [2020-07-29 01:19:25,206 INFO L280 TraceCheckUtils]: 24: Hoare triple {12217#false} assume 0 == ~x~0.base || 1 == #valid[~x~0.base];call ULTIMATE.dealloc(~x~0.base, ~x~0.offset);#res := 0; {12217#false} is VALID [2020-07-29 01:19:25,206 INFO L280 TraceCheckUtils]: 25: Hoare triple {12217#false} assume !(#valid == old(#valid)); {12217#false} is VALID [2020-07-29 01:19:25,208 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:25,208 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897420761] [2020-07-29 01:19:25,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:25,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-29 01:19:25,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771878801] [2020-07-29 01:19:25,209 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-07-29 01:19:25,209 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:25,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-29 01:19:25,252 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:25,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-29 01:19:25,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:25,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-29 01:19:25,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:19:25,254 INFO L87 Difference]: Start difference. First operand 122 states and 145 transitions. Second operand 10 states. [2020-07-29 01:19:26,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:26,749 INFO L93 Difference]: Finished difference Result 140 states and 150 transitions. [2020-07-29 01:19:26,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-29 01:19:26,749 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-07-29 01:19:26,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:26,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:19:26,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 146 transitions. [2020-07-29 01:19:26,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:19:26,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 146 transitions. [2020-07-29 01:19:26,752 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 146 transitions. [2020-07-29 01:19:26,977 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:26,979 INFO L225 Difference]: With dead ends: 140 [2020-07-29 01:19:26,980 INFO L226 Difference]: Without dead ends: 140 [2020-07-29 01:19:26,980 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2020-07-29 01:19:26,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-07-29 01:19:26,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 122. [2020-07-29 01:19:26,983 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:26,983 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand 122 states. [2020-07-29 01:19:26,984 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand 122 states. [2020-07-29 01:19:26,984 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 122 states. [2020-07-29 01:19:26,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:26,987 INFO L93 Difference]: Finished difference Result 140 states and 150 transitions. [2020-07-29 01:19:26,987 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 150 transitions. [2020-07-29 01:19:26,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:26,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:26,988 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 140 states. [2020-07-29 01:19:26,988 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 140 states. [2020-07-29 01:19:26,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:26,991 INFO L93 Difference]: Finished difference Result 140 states and 150 transitions. [2020-07-29 01:19:26,991 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 150 transitions. [2020-07-29 01:19:26,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:26,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:26,992 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:26,992 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:26,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-07-29 01:19:26,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 144 transitions. [2020-07-29 01:19:26,994 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 144 transitions. Word has length 26 [2020-07-29 01:19:26,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:26,995 INFO L479 AbstractCegarLoop]: Abstraction has 122 states and 144 transitions. [2020-07-29 01:19:26,995 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-29 01:19:26,995 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 144 transitions. [2020-07-29 01:19:26,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-29 01:19:26,996 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:26,996 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, 1, 1, 1, 1, 1] [2020-07-29 01:19:26,996 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-07-29 01:19:26,997 INFO L427 AbstractCegarLoop]: === Iteration 24 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:19:26,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:26,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1012463367, now seen corresponding path program 1 times [2020-07-29 01:19:26,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:26,998 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579688847] [2020-07-29 01:19:26,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:27,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:27,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:27,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:27,043 INFO L280 TraceCheckUtils]: 0: Hoare triple {12789#(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; {12783#true} is VALID [2020-07-29 01:19:27,044 INFO L280 TraceCheckUtils]: 1: Hoare triple {12783#true} assume true; {12783#true} is VALID [2020-07-29 01:19:27,044 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {12783#true} {12783#true} #204#return; {12783#true} is VALID [2020-07-29 01:19:27,045 INFO L263 TraceCheckUtils]: 0: Hoare triple {12783#true} call ULTIMATE.init(); {12789#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:27,045 INFO L280 TraceCheckUtils]: 1: Hoare triple {12789#(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; {12783#true} is VALID [2020-07-29 01:19:27,045 INFO L280 TraceCheckUtils]: 2: Hoare triple {12783#true} assume true; {12783#true} is VALID [2020-07-29 01:19:27,045 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {12783#true} {12783#true} #204#return; {12783#true} is VALID [2020-07-29 01:19:27,045 INFO L263 TraceCheckUtils]: 4: Hoare triple {12783#true} call #t~ret18 := main(); {12783#true} is VALID [2020-07-29 01:19:27,045 INFO L280 TraceCheckUtils]: 5: Hoare triple {12783#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {12783#true} is VALID [2020-07-29 01:19:27,046 INFO L280 TraceCheckUtils]: 6: Hoare triple {12783#true} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset, 4); srcloc: L987 {12783#true} is VALID [2020-07-29 01:19:27,046 INFO L280 TraceCheckUtils]: 7: Hoare triple {12783#true} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L987-1 {12783#true} is VALID [2020-07-29 01:19:27,046 INFO L280 TraceCheckUtils]: 8: Hoare triple {12783#true} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;~state~0 := 1; {12788#(= 1 main_~state~0)} is VALID [2020-07-29 01:19:27,047 INFO L280 TraceCheckUtils]: 9: Hoare triple {12788#(= 1 main_~state~0)} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {12788#(= 1 main_~state~0)} is VALID [2020-07-29 01:19:27,047 INFO L280 TraceCheckUtils]: 10: Hoare triple {12788#(= 1 main_~state~0)} assume !!(0 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12); {12788#(= 1 main_~state~0)} is VALID [2020-07-29 01:19:27,055 INFO L280 TraceCheckUtils]: 11: Hoare triple {12788#(= 1 main_~state~0)} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L997 {12788#(= 1 main_~state~0)} is VALID [2020-07-29 01:19:27,058 INFO L280 TraceCheckUtils]: 12: Hoare triple {12788#(= 1 main_~state~0)} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L997-1 {12788#(= 1 main_~state~0)} is VALID [2020-07-29 01:19:27,060 INFO L280 TraceCheckUtils]: 13: Hoare triple {12788#(= 1 main_~state~0)} SUMMARY for call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem3.base, 4 + #t~mem3.offset, 4); srcloc: L998 {12788#(= 1 main_~state~0)} is VALID [2020-07-29 01:19:27,061 INFO L280 TraceCheckUtils]: 14: Hoare triple {12788#(= 1 main_~state~0)} havoc #t~mem3.base, #t~mem3.offset; {12788#(= 1 main_~state~0)} is VALID [2020-07-29 01:19:27,062 INFO L280 TraceCheckUtils]: 15: Hoare triple {12788#(= 1 main_~state~0)} SUMMARY for call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L999 {12788#(= 1 main_~state~0)} is VALID [2020-07-29 01:19:27,062 INFO L280 TraceCheckUtils]: 16: Hoare triple {12788#(= 1 main_~state~0)} ~x~0.base, ~x~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset; {12788#(= 1 main_~state~0)} is VALID [2020-07-29 01:19:27,062 INFO L280 TraceCheckUtils]: 17: Hoare triple {12788#(= 1 main_~state~0)} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L1000 {12788#(= 1 main_~state~0)} is VALID [2020-07-29 01:19:27,063 INFO L280 TraceCheckUtils]: 18: Hoare triple {12788#(= 1 main_~state~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {12788#(= 1 main_~state~0)} is VALID [2020-07-29 01:19:27,063 INFO L280 TraceCheckUtils]: 19: Hoare triple {12788#(= 1 main_~state~0)} assume 0 != #t~nondet5;havoc #t~nondet5; {12788#(= 1 main_~state~0)} is VALID [2020-07-29 01:19:27,064 INFO L280 TraceCheckUtils]: 20: Hoare triple {12788#(= 1 main_~state~0)} assume !(1 == ~state~0); {12784#false} is VALID [2020-07-29 01:19:27,064 INFO L280 TraceCheckUtils]: 21: Hoare triple {12784#false} assume !(2 == ~state~0); {12784#false} is VALID [2020-07-29 01:19:27,064 INFO L280 TraceCheckUtils]: 22: Hoare triple {12784#false} SUMMARY for call write~int(~state~0, ~x~0.base, 8 + ~x~0.offset, 4); srcloc: L994-3 {12784#false} is VALID [2020-07-29 01:19:27,064 INFO L280 TraceCheckUtils]: 23: Hoare triple {12784#false} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); srcloc: L1016 {12784#false} is VALID [2020-07-29 01:19:27,064 INFO L280 TraceCheckUtils]: 24: Hoare triple {12784#false} ~x~0.base, ~x~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {12784#false} is VALID [2020-07-29 01:19:27,064 INFO L280 TraceCheckUtils]: 25: Hoare triple {12784#false} assume !(0 != ~x~0.base || 0 != ~x~0.offset); {12784#false} is VALID [2020-07-29 01:19:27,065 INFO L280 TraceCheckUtils]: 26: Hoare triple {12784#false} assume !false; {12784#false} is VALID [2020-07-29 01:19:27,065 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:27,065 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579688847] [2020-07-29 01:19:27,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:27,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 01:19:27,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288219328] [2020-07-29 01:19:27,066 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-07-29 01:19:27,066 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:27,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:19:27,103 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:27,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:19:27,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:27,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:19:27,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:19:27,105 INFO L87 Difference]: Start difference. First operand 122 states and 144 transitions. Second operand 4 states. [2020-07-29 01:19:27,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:27,435 INFO L93 Difference]: Finished difference Result 191 states and 218 transitions. [2020-07-29 01:19:27,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:19:27,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-07-29 01:19:27,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:27,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:19:27,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 157 transitions. [2020-07-29 01:19:27,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:19:27,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 157 transitions. [2020-07-29 01:19:27,439 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 157 transitions. [2020-07-29 01:19:27,654 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:27,658 INFO L225 Difference]: With dead ends: 191 [2020-07-29 01:19:27,658 INFO L226 Difference]: Without dead ends: 191 [2020-07-29 01:19:27,658 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:27,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2020-07-29 01:19:27,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 137. [2020-07-29 01:19:27,662 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:27,663 INFO L82 GeneralOperation]: Start isEquivalent. First operand 191 states. Second operand 137 states. [2020-07-29 01:19:27,663 INFO L74 IsIncluded]: Start isIncluded. First operand 191 states. Second operand 137 states. [2020-07-29 01:19:27,663 INFO L87 Difference]: Start difference. First operand 191 states. Second operand 137 states. [2020-07-29 01:19:27,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:27,667 INFO L93 Difference]: Finished difference Result 191 states and 218 transitions. [2020-07-29 01:19:27,668 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 218 transitions. [2020-07-29 01:19:27,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:27,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:27,669 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand 191 states. [2020-07-29 01:19:27,669 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 191 states. [2020-07-29 01:19:27,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:27,679 INFO L93 Difference]: Finished difference Result 191 states and 218 transitions. [2020-07-29 01:19:27,679 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 218 transitions. [2020-07-29 01:19:27,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:27,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:27,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:27,681 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:27,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-07-29 01:19:27,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 161 transitions. [2020-07-29 01:19:27,684 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 161 transitions. Word has length 27 [2020-07-29 01:19:27,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:27,685 INFO L479 AbstractCegarLoop]: Abstraction has 137 states and 161 transitions. [2020-07-29 01:19:27,685 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:19:27,685 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 161 transitions. [2020-07-29 01:19:27,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-29 01:19:27,686 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:27,686 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, 1, 1, 1, 1, 1, 1] [2020-07-29 01:19:27,686 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-07-29 01:19:27,687 INFO L427 AbstractCegarLoop]: === Iteration 25 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:19:27,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:27,688 INFO L82 PathProgramCache]: Analyzing trace with hash -682632713, now seen corresponding path program 1 times [2020-07-29 01:19:27,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:27,688 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083219988] [2020-07-29 01:19:27,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:27,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:19:27,705 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:19:27,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:19:27,719 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:19:27,794 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:19:27,797 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-29 01:19:27,798 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-07-29 01:19:27,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.07 01:19:27 BoogieIcfgContainer [2020-07-29 01:19:27,882 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-29 01:19:27,883 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:19:27,883 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:19:27,883 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:19:27,884 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:18:45" (3/4) ... [2020-07-29 01:19:27,887 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-07-29 01:19:27,976 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-29 01:19:27,976 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:19:27,979 INFO L168 Benchmark]: Toolchain (without parser) took 44494.99 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 589.8 MB). Free memory was 961.6 MB in the beginning and 1.6 GB in the end (delta: -615.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:19:27,980 INFO L168 Benchmark]: CDTParser took 0.52 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:19:27,981 INFO L168 Benchmark]: CACSL2BoogieTranslator took 695.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -155.4 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:19:27,981 INFO L168 Benchmark]: Boogie Preprocessor took 74.89 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:19:27,981 INFO L168 Benchmark]: RCFGBuilder took 1032.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 84.9 MB). Peak memory consumption was 84.9 MB. Max. memory is 11.5 GB. [2020-07-29 01:19:27,982 INFO L168 Benchmark]: TraceAbstraction took 42590.38 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 453.0 MB). Free memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: -550.2 MB). Peak memory consumption was 663.3 MB. Max. memory is 11.5 GB. [2020-07-29 01:19:27,982 INFO L168 Benchmark]: Witness Printer took 93.57 ms. Allocated memory is still 1.6 GB. Free memory is still 1.6 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:19:27,984 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.52 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 695.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -155.4 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 74.89 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1032.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 84.9 MB). Peak memory consumption was 84.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 42590.38 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 453.0 MB). Free memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: -550.2 MB). Peak memory consumption was 663.3 MB. Max. memory is 11.5 GB. * Witness Printer took 93.57 ms. Allocated memory is still 1.6 GB. Free memory is still 1.6 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1023]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L986] SLL* head = malloc(sizeof(SLL)); VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}] [L987] head->next = head VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}] [L988] head->data = 0 VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}] [L990] SLL* x = head; [L991] int state = 1; VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}] [L994] COND FALSE !(__VERIFIER_nondet_int()) [L1016] x->data = state VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}] [L1018] EXPR head->next VAL [head={-1:0}, head->next={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}] [L1018] x = head->next [L1019] COND FALSE !(!(((void*)0) != x)) VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}] [L1021] EXPR x->data VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}, x->data=1] [L1021] COND TRUE x->data != 0 [L1023] EXPR x->next VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}, x->next={-1:0}] [L1023] EXPR x->next->data VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}, x->next={-1:0}, x->next->data=1] [L1023] EXPR x->next->data != 0 && x->data > x->next->data VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data != 0 && x->data > x->next->data=1] [L1023] EXPR x->data VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next->data=1, x->next->data != 0 && x->data > x->next->data=1] [L1023] EXPR x->next VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data != 0 && x->data > x->next->data=1] [L1023] EXPR x->next->data VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data=1, x->next->data != 0 && x->data > x->next->data=1] [L1023] EXPR x->next->data != 0 && x->data > x->next->data VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data=1, x->next->data != 0 && x->data > x->next->data=0] [L1023] COND TRUE !(x->next->data != 0 && x->data > x->next->data) [L1023] __VERIFIER_error() VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 113 locations, 50 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 42.4s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 35.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1577 SDtfs, 4284 SDslu, 4966 SDs, 0 SdLazy, 7647 SolverSat, 370 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 340 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 24 MinimizatonAttempts, 743 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 484 NumberOfCodeBlocks, 484 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 432 ConstructedInterpolants, 0 QuantifiedInterpolants, 72337 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...