./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/list-ext-properties/simple-ext.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 6692e4fc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext-properties/simple-ext.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 e1c4f57eca82444dbac59d6fae1e4e6e28bb6c95 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6692e4f [2019-11-25 17:58:42,243 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 17:58:42,246 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 17:58:42,266 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 17:58:42,267 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 17:58:42,269 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 17:58:42,271 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 17:58:42,274 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 17:58:42,275 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 17:58:42,287 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 17:58:42,288 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 17:58:42,291 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 17:58:42,291 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 17:58:42,294 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 17:58:42,296 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 17:58:42,297 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 17:58:42,299 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 17:58:42,302 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 17:58:42,306 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 17:58:42,308 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 17:58:42,311 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 17:58:42,312 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 17:58:42,313 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 17:58:42,314 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 17:58:42,316 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 17:58:42,316 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 17:58:42,317 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 17:58:42,318 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 17:58:42,318 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 17:58:42,319 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 17:58:42,319 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 17:58:42,320 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 17:58:42,321 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 17:58:42,322 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 17:58:42,323 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 17:58:42,323 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 17:58:42,324 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 17:58:42,324 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 17:58:42,324 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 17:58:42,325 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 17:58:42,326 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 17:58:42,327 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2019-11-25 17:58:42,341 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 17:58:42,341 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 17:58:42,342 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 17:58:42,342 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 17:58:42,343 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 17:58:42,343 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 17:58:42,343 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 17:58:42,344 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 17:58:42,344 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 17:58:42,344 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 17:58:42,344 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 17:58:42,345 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-25 17:58:42,345 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-25 17:58:42,345 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 17:58:42,346 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-25 17:58:42,346 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 17:58:42,346 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 17:58:42,346 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 17:58:42,347 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 17:58:42,347 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 17:58:42,347 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 17:58:42,348 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 17:58:42,348 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 17:58:42,348 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 17:58:42,348 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 17:58:42,349 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 17:58:42,349 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 -> e1c4f57eca82444dbac59d6fae1e4e6e28bb6c95 [2019-11-25 17:58:42,677 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 17:58:42,696 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 17:58:42,700 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 17:58:42,701 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 17:58:42,701 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 17:58:42,702 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/simple-ext.i [2019-11-25 17:58:42,770 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81b8ea768/75f07ab31a26464684b9be3f4db9ed3a/FLAG8ecc5ef3e [2019-11-25 17:58:43,257 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 17:58:43,258 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/simple-ext.i [2019-11-25 17:58:43,278 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81b8ea768/75f07ab31a26464684b9be3f4db9ed3a/FLAG8ecc5ef3e [2019-11-25 17:58:43,604 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81b8ea768/75f07ab31a26464684b9be3f4db9ed3a [2019-11-25 17:58:43,608 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 17:58:43,609 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-25 17:58:43,611 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 17:58:43,611 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 17:58:43,614 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 17:58:43,615 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:58:43" (1/1) ... [2019-11-25 17:58:43,618 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7085489f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:43, skipping insertion in model container [2019-11-25 17:58:43,619 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:58:43" (1/1) ... [2019-11-25 17:58:43,627 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 17:58:43,688 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-25 17:58:44,185 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 17:58:44,199 INFO L203 MainTranslator]: Completed pre-run [2019-11-25 17:58:44,253 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 17:58:44,313 INFO L208 MainTranslator]: Completed translation [2019-11-25 17:58:44,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:44 WrapperNode [2019-11-25 17:58:44,314 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 17:58:44,315 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 17:58:44,315 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 17:58:44,315 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 17:58:44,328 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:44" (1/1) ... [2019-11-25 17:58:44,328 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:44" (1/1) ... [2019-11-25 17:58:44,342 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:44" (1/1) ... [2019-11-25 17:58:44,343 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:44" (1/1) ... [2019-11-25 17:58:44,359 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:44" (1/1) ... [2019-11-25 17:58:44,365 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:44" (1/1) ... [2019-11-25 17:58:44,368 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:44" (1/1) ... [2019-11-25 17:58:44,374 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 17:58:44,375 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 17:58:44,375 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 17:58:44,375 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 17:58:44,376 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 17:58:44,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-25 17:58:44,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 17:58:44,440 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-25 17:58:44,440 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-25 17:58:44,440 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-25 17:58:44,440 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-25 17:58:44,440 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-25 17:58:44,440 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-25 17:58:44,441 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-25 17:58:44,441 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-25 17:58:44,441 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-25 17:58:44,441 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-25 17:58:44,441 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-25 17:58:44,442 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-25 17:58:44,442 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-25 17:58:44,442 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-25 17:58:44,442 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-25 17:58:44,442 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-25 17:58:44,442 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-25 17:58:44,442 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-25 17:58:44,443 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-25 17:58:44,443 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-25 17:58:44,443 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-25 17:58:44,443 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-25 17:58:44,443 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-25 17:58:44,443 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-25 17:58:44,444 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-25 17:58:44,444 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-25 17:58:44,444 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-25 17:58:44,444 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-25 17:58:44,444 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-25 17:58:44,444 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-25 17:58:44,444 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-25 17:58:44,445 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-25 17:58:44,445 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-25 17:58:44,445 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-25 17:58:44,445 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-25 17:58:44,445 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-25 17:58:44,445 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-25 17:58:44,445 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-25 17:58:44,446 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-25 17:58:44,446 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-25 17:58:44,446 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-25 17:58:44,446 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-25 17:58:44,446 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-25 17:58:44,446 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-25 17:58:44,446 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-25 17:58:44,447 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-25 17:58:44,447 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-25 17:58:44,447 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-25 17:58:44,447 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-25 17:58:44,447 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-25 17:58:44,447 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-25 17:58:44,447 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-25 17:58:44,448 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-25 17:58:44,448 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-25 17:58:44,448 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-25 17:58:44,448 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-25 17:58:44,448 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-25 17:58:44,448 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-25 17:58:44,448 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-25 17:58:44,449 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-25 17:58:44,449 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-25 17:58:44,449 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-25 17:58:44,449 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-25 17:58:44,449 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-25 17:58:44,449 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-25 17:58:44,449 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-25 17:58:44,450 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-25 17:58:44,450 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-25 17:58:44,451 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-25 17:58:44,451 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-25 17:58:44,451 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-25 17:58:44,451 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-25 17:58:44,452 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-25 17:58:44,452 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-25 17:58:44,452 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-25 17:58:44,453 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-25 17:58:44,453 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-25 17:58:44,454 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-25 17:58:44,454 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-25 17:58:44,454 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-25 17:58:44,454 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-25 17:58:44,454 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-25 17:58:44,455 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-25 17:58:44,455 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-25 17:58:44,455 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-25 17:58:44,455 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-25 17:58:44,456 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-25 17:58:44,456 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-25 17:58:44,456 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-25 17:58:44,456 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-25 17:58:44,456 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-25 17:58:44,456 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-25 17:58:44,456 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-25 17:58:44,457 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-25 17:58:44,457 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-25 17:58:44,457 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-25 17:58:44,457 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-25 17:58:44,457 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-25 17:58:44,457 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-25 17:58:44,458 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-25 17:58:44,458 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-25 17:58:44,458 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-25 17:58:44,458 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-25 17:58:44,458 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-25 17:58:44,458 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-25 17:58:44,459 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-25 17:58:44,459 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-25 17:58:44,459 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-25 17:58:44,459 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-25 17:58:44,459 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-25 17:58:44,459 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-25 17:58:44,459 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-25 17:58:44,460 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-25 17:58:44,460 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-25 17:58:44,460 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-25 17:58:44,460 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-25 17:58:44,461 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-25 17:58:44,461 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-25 17:58:44,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-25 17:58:44,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-25 17:58:44,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-25 17:58:44,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-25 17:58:44,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-25 17:58:44,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 17:58:44,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-25 17:58:44,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 17:58:44,821 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-25 17:58:45,065 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 17:58:45,066 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-25 17:58:45,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:58:45 BoogieIcfgContainer [2019-11-25 17:58:45,067 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 17:58:45,068 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 17:58:45,068 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 17:58:45,071 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 17:58:45,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:58:43" (1/3) ... [2019-11-25 17:58:45,072 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@131675d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:58:45, skipping insertion in model container [2019-11-25 17:58:45,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:44" (2/3) ... [2019-11-25 17:58:45,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@131675d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:58:45, skipping insertion in model container [2019-11-25 17:58:45,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:58:45" (3/3) ... [2019-11-25 17:58:45,074 INFO L109 eAbstractionObserver]: Analyzing ICFG simple-ext.i [2019-11-25 17:58:45,083 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 17:58:45,091 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2019-11-25 17:58:45,102 INFO L249 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2019-11-25 17:58:45,121 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 17:58:45,121 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-25 17:58:45,122 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 17:58:45,122 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 17:58:45,122 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 17:58:45,122 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 17:58:45,122 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 17:58:45,123 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 17:58:45,140 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2019-11-25 17:58:45,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-25 17:58:45,150 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:58:45,151 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:58:45,152 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr19ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-25 17:58:45,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:58:45,158 INFO L82 PathProgramCache]: Analyzing trace with hash -746638641, now seen corresponding path program 1 times [2019-11-25 17:58:45,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:58:45,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721067196] [2019-11-25 17:58:45,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:58:45,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:45,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:45,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:58:45,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721067196] [2019-11-25 17:58:45,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:58:45,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 17:58:45,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035164091] [2019-11-25 17:58:45,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 17:58:45,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:58:45,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 17:58:45,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 17:58:45,373 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 3 states. [2019-11-25 17:58:45,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:58:45,553 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2019-11-25 17:58:45,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 17:58:45,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-25 17:58:45,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:58:45,564 INFO L225 Difference]: With dead ends: 62 [2019-11-25 17:58:45,564 INFO L226 Difference]: Without dead ends: 54 [2019-11-25 17:58:45,565 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 17:58:45,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-25 17:58:45,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-11-25 17:58:45,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-25 17:58:45,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2019-11-25 17:58:45,597 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 10 [2019-11-25 17:58:45,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:58:45,598 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2019-11-25 17:58:45,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 17:58:45,598 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2019-11-25 17:58:45,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-25 17:58:45,599 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:58:45,599 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:58:45,600 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr19ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-25 17:58:45,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:58:45,600 INFO L82 PathProgramCache]: Analyzing trace with hash -261147736, now seen corresponding path program 1 times [2019-11-25 17:58:45,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:58:45,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125554389] [2019-11-25 17:58:45,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:58:45,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:45,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:45,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:58:45,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125554389] [2019-11-25 17:58:45,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:58:45,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 17:58:45,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052120848] [2019-11-25 17:58:45,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 17:58:45,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:58:45,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 17:58:45,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 17:58:45,717 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 5 states. [2019-11-25 17:58:45,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:58:45,950 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2019-11-25 17:58:45,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 17:58:45,951 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-25 17:58:45,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:58:45,952 INFO L225 Difference]: With dead ends: 72 [2019-11-25 17:58:45,952 INFO L226 Difference]: Without dead ends: 72 [2019-11-25 17:58:45,953 INFO L630 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 [2019-11-25 17:58:45,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-25 17:58:45,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 58. [2019-11-25 17:58:45,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-25 17:58:45,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2019-11-25 17:58:45,972 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 12 [2019-11-25 17:58:45,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:58:45,972 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2019-11-25 17:58:45,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 17:58:45,973 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2019-11-25 17:58:45,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-25 17:58:45,973 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:58:45,973 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:58:45,975 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr19ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-25 17:58:45,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:58:45,976 INFO L82 PathProgramCache]: Analyzing trace with hash -261147735, now seen corresponding path program 1 times [2019-11-25 17:58:45,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:58:45,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642306221] [2019-11-25 17:58:45,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:58:46,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:46,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:46,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:58:46,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642306221] [2019-11-25 17:58:46,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:58:46,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 17:58:46,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273355311] [2019-11-25 17:58:46,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 17:58:46,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:58:46,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 17:58:46,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 17:58:46,122 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand 5 states. [2019-11-25 17:58:46,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:58:46,321 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2019-11-25 17:58:46,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 17:58:46,321 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-25 17:58:46,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:58:46,323 INFO L225 Difference]: With dead ends: 77 [2019-11-25 17:58:46,323 INFO L226 Difference]: Without dead ends: 77 [2019-11-25 17:58:46,324 INFO L630 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 [2019-11-25 17:58:46,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-25 17:58:46,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 67. [2019-11-25 17:58:46,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-25 17:58:46,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2019-11-25 17:58:46,332 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 12 [2019-11-25 17:58:46,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:58:46,332 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2019-11-25 17:58:46,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 17:58:46,333 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2019-11-25 17:58:46,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-25 17:58:46,333 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:58:46,334 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:58:46,334 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr19ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-25 17:58:46,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:58:46,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1733653831, now seen corresponding path program 1 times [2019-11-25 17:58:46,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:58:46,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997771787] [2019-11-25 17:58:46,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:58:46,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:46,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:46,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:58:46,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997771787] [2019-11-25 17:58:46,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:58:46,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 17:58:46,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772918707] [2019-11-25 17:58:46,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 17:58:46,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:58:46,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 17:58:46,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-25 17:58:46,433 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand 6 states. [2019-11-25 17:58:46,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:58:46,609 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2019-11-25 17:58:46,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 17:58:46,609 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-11-25 17:58:46,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:58:46,611 INFO L225 Difference]: With dead ends: 73 [2019-11-25 17:58:46,611 INFO L226 Difference]: Without dead ends: 73 [2019-11-25 17:58:46,611 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-25 17:58:46,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-25 17:58:46,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2019-11-25 17:58:46,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-25 17:58:46,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2019-11-25 17:58:46,618 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 19 [2019-11-25 17:58:46,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:58:46,618 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2019-11-25 17:58:46,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 17:58:46,618 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2019-11-25 17:58:46,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-25 17:58:46,619 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:58:46,619 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:58:46,620 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr19ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-25 17:58:46,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:58:46,620 INFO L82 PathProgramCache]: Analyzing trace with hash 838007822, now seen corresponding path program 1 times [2019-11-25 17:58:46,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:58:46,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023211895] [2019-11-25 17:58:46,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:58:46,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:46,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:46,794 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:58:46,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023211895] [2019-11-25 17:58:46,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:58:46,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-25 17:58:46,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131235421] [2019-11-25 17:58:46,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 17:58:46,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:58:46,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 17:58:46,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-25 17:58:46,798 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand 8 states. [2019-11-25 17:58:47,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:58:47,053 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2019-11-25 17:58:47,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 17:58:47,054 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-11-25 17:58:47,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:58:47,055 INFO L225 Difference]: With dead ends: 82 [2019-11-25 17:58:47,055 INFO L226 Difference]: Without dead ends: 76 [2019-11-25 17:58:47,056 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-25 17:58:47,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-25 17:58:47,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2019-11-25 17:58:47,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-25 17:58:47,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-11-25 17:58:47,062 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 21 [2019-11-25 17:58:47,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:58:47,063 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-11-25 17:58:47,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 17:58:47,063 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-11-25 17:58:47,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-25 17:58:47,064 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:58:47,064 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:58:47,065 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr19ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-25 17:58:47,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:58:47,065 INFO L82 PathProgramCache]: Analyzing trace with hash -2032942662, now seen corresponding path program 1 times [2019-11-25 17:58:47,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:58:47,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607714135] [2019-11-25 17:58:47,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:58:47,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:47,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:47,148 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:58:47,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607714135] [2019-11-25 17:58:47,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:58:47,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 17:58:47,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813668870] [2019-11-25 17:58:47,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 17:58:47,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:58:47,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 17:58:47,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-25 17:58:47,152 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 7 states. [2019-11-25 17:58:47,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:58:47,379 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2019-11-25 17:58:47,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 17:58:47,379 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-11-25 17:58:47,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:58:47,381 INFO L225 Difference]: With dead ends: 66 [2019-11-25 17:58:47,381 INFO L226 Difference]: Without dead ends: 66 [2019-11-25 17:58:47,381 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-25 17:58:47,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-25 17:58:47,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2019-11-25 17:58:47,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-25 17:58:47,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-11-25 17:58:47,386 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 21 [2019-11-25 17:58:47,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:58:47,387 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-11-25 17:58:47,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 17:58:47,387 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-11-25 17:58:47,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-25 17:58:47,388 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:58:47,388 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:58:47,389 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr19ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-25 17:58:47,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:58:47,389 INFO L82 PathProgramCache]: Analyzing trace with hash -2032942661, now seen corresponding path program 1 times [2019-11-25 17:58:47,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:58:47,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33067631] [2019-11-25 17:58:47,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:58:47,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:47,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:47,510 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:58:47,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33067631] [2019-11-25 17:58:47,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:58:47,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 17:58:47,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613704651] [2019-11-25 17:58:47,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 17:58:47,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:58:47,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 17:58:47,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-25 17:58:47,516 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 7 states. [2019-11-25 17:58:47,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:58:47,864 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2019-11-25 17:58:47,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 17:58:47,866 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-11-25 17:58:47,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:58:47,867 INFO L225 Difference]: With dead ends: 59 [2019-11-25 17:58:47,867 INFO L226 Difference]: Without dead ends: 59 [2019-11-25 17:58:47,867 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-25 17:58:47,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-25 17:58:47,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2019-11-25 17:58:47,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-25 17:58:47,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-11-25 17:58:47,872 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 21 [2019-11-25 17:58:47,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:58:47,872 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-11-25 17:58:47,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 17:58:47,872 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2019-11-25 17:58:47,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-25 17:58:47,873 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:58:47,873 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:58:47,874 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr19ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-25 17:58:47,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:58:47,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1979195964, now seen corresponding path program 1 times [2019-11-25 17:58:47,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:58:47,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174706303] [2019-11-25 17:58:47,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:58:47,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:48,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:48,089 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:58:48,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174706303] [2019-11-25 17:58:48,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93647183] [2019-11-25 17:58:48,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:58:48,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:48,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-25 17:58:48,208 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:58:48,270 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-25 17:58:48,271 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:58:48,285 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:58:48,286 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:58:48,286 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 17:58:48,347 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-25 17:58:48,348 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:58:48,359 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:58:48,360 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:58:48,360 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-11-25 17:58:48,413 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:58:48,414 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-25 17:58:48,414 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:58:48,428 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:58:48,428 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:58:48,428 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:24 [2019-11-25 17:58:48,478 INFO L404 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_14|], 2=[|v_#memory_int_13|]} [2019-11-25 17:58:48,485 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-25 17:58:48,485 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:58:48,507 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:58:48,516 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:58:48,518 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-25 17:58:48,519 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:58:48,534 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:58:48,535 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:58:48,535 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:30 [2019-11-25 17:58:48,579 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-25 17:58:48,580 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:58:48,588 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:58:48,588 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:58:48,589 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:18 [2019-11-25 17:58:48,657 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-25 17:58:48,658 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:58:48,668 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:58:48,669 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:58:48,669 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:18 [2019-11-25 17:58:48,678 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-25 17:58:48,678 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:58:48,701 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:58:48,701 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:58:48,702 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:14 [2019-11-25 17:58:48,752 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-25 17:58:48,753 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:58:48,760 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:58:48,761 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:58:48,761 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:3 [2019-11-25 17:58:48,785 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:58:48,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:58:48,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-11-25 17:58:48,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3957237] [2019-11-25 17:58:48,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-25 17:58:48,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:58:48,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-25 17:58:48,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2019-11-25 17:58:48,788 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 22 states. [2019-11-25 17:58:49,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:58:49,447 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2019-11-25 17:58:49,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-25 17:58:49,447 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2019-11-25 17:58:49,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:58:49,448 INFO L225 Difference]: With dead ends: 83 [2019-11-25 17:58:49,448 INFO L226 Difference]: Without dead ends: 77 [2019-11-25 17:58:49,449 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=171, Invalid=641, Unknown=0, NotChecked=0, Total=812 [2019-11-25 17:58:49,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-25 17:58:49,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 62. [2019-11-25 17:58:49,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-25 17:58:49,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2019-11-25 17:58:49,453 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 30 [2019-11-25 17:58:49,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:58:49,454 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2019-11-25 17:58:49,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-25 17:58:49,454 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2019-11-25 17:58:49,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-25 17:58:49,455 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:58:49,455 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:58:49,658 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:58:49,659 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr19ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-25 17:58:49,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:58:49,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1282404402, now seen corresponding path program 2 times [2019-11-25 17:58:49,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:58:49,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439225885] [2019-11-25 17:58:49,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:58:49,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:50,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:50,021 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:58:50,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439225885] [2019-11-25 17:58:50,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853008645] [2019-11-25 17:58:50,022 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:58:50,136 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-25 17:58:50,137 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 17:58:50,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 45 conjunts are in the unsatisfiable core [2019-11-25 17:58:50,142 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:58:50,147 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-25 17:58:50,148 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:58:50,152 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:58:50,152 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:58:50,152 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 17:58:50,212 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:58:50,212 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-25 17:58:50,213 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:58:50,234 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:58:50,234 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:58:50,235 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-11-25 17:58:50,316 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-25 17:58:50,316 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:58:50,327 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:58:50,328 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:58:50,328 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2019-11-25 17:58:50,457 INFO L343 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2019-11-25 17:58:50,458 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 27 [2019-11-25 17:58:50,459 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:58:50,479 INFO L588 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-11-25 17:58:50,480 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:58:50,480 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:22 [2019-11-25 17:58:50,523 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:58:50,523 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-25 17:58:50,524 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:58:50,534 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:58:50,535 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:58:50,535 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:27 [2019-11-25 17:58:50,606 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:58:50,606 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 60 [2019-11-25 17:58:50,607 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:58:50,638 INFO L588 ElimStorePlain]: treesize reduction 34, result has 50.7 percent of original size [2019-11-25 17:58:50,639 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:58:50,639 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:32 [2019-11-25 17:58:50,895 INFO L343 Elim1Store]: treesize reduction 48, result has 53.4 percent of original size [2019-11-25 17:58:50,895 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 74 [2019-11-25 17:58:50,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:58:50,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:58:50,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:58:50,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:58:50,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:58:50,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:58:50,904 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 17:58:50,943 INFO L588 ElimStorePlain]: treesize reduction 26, result has 63.4 percent of original size [2019-11-25 17:58:50,944 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 17:58:50,944 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:71, output treesize:54 [2019-11-25 17:58:50,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:58:51,038 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:58:51,039 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 65 [2019-11-25 17:58:51,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:58:51,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:58:51,042 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-25 17:58:51,090 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:58:51,091 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 131 [2019-11-25 17:58:51,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:58:51,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:58:51,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:58:51,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:58:51,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:58:51,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:58:51,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:58:51,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:58:51,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:58:51,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:58:51,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:58:51,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:58:51,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:58:51,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:58:51,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:58:51,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:58:51,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:58:51,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:58:51,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:58:51,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:58:51,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:58:51,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:58:51,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:58:51,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:58:51,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:58:51,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:58:51,138 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 7 xjuncts. [2019-11-25 17:58:51,295 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 33 [2019-11-25 17:58:51,297 INFO L588 ElimStorePlain]: treesize reduction 1285, result has 7.4 percent of original size [2019-11-25 17:58:51,298 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-11-25 17:58:51,298 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:129, output treesize:103 [2019-11-25 17:58:51,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:58:51,519 INFO L404 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|], 6=[v_prenex_4]} [2019-11-25 17:58:51,527 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:58:51,528 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 33 [2019-11-25 17:58:51,529 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:58:51,563 INFO L588 ElimStorePlain]: treesize reduction 14, result has 83.1 percent of original size [2019-11-25 17:58:51,587 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:58:51,588 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 70 [2019-11-25 17:58:51,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:58:51,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:58:51,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:58:51,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:58:51,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:58:51,594 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:58:51,641 INFO L588 ElimStorePlain]: treesize reduction 83, result has 20.2 percent of original size [2019-11-25 17:58:51,641 INFO L508 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:58:51,642 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:97, output treesize:5 [2019-11-25 17:58:51,708 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:58:51,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:58:51,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2019-11-25 17:58:51,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446550423] [2019-11-25 17:58:51,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-25 17:58:51,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:58:51,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-25 17:58:51,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=842, Unknown=0, NotChecked=0, Total=930 [2019-11-25 17:58:51,711 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand 31 states. [2019-11-25 17:58:53,179 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 52 [2019-11-25 17:58:53,475 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 55 [2019-11-25 17:58:53,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:58:53,939 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2019-11-25 17:58:53,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-25 17:58:53,939 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 39 [2019-11-25 17:58:53,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:58:53,940 INFO L225 Difference]: With dead ends: 56 [2019-11-25 17:58:53,940 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 17:58:53,942 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=391, Invalid=2261, Unknown=0, NotChecked=0, Total=2652 [2019-11-25 17:58:53,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 17:58:53,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 17:58:53,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 17:58:53,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 17:58:53,943 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2019-11-25 17:58:53,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:58:53,943 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 17:58:53,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-25 17:58:53,943 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 17:58:53,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 17:58:54,144 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:58:54,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:58:54 BoogieIcfgContainer [2019-11-25 17:58:54,151 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 17:58:54,152 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 17:58:54,152 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 17:58:54,152 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 17:58:54,153 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:58:45" (3/4) ... [2019-11-25 17:58:54,156 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 17:58:54,163 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-25 17:58:54,163 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2019-11-25 17:58:54,163 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-11-25 17:58:54,164 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-11-25 17:58:54,164 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-11-25 17:58:54,164 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-11-25 17:58:54,164 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-25 17:58:54,165 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-11-25 17:58:54,170 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-11-25 17:58:54,171 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-25 17:58:54,171 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-25 17:58:54,171 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-25 17:58:54,228 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-25 17:58:54,228 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 17:58:54,230 INFO L168 Benchmark]: Toolchain (without parser) took 10620.84 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 325.1 MB). Free memory was 956.3 MB in the beginning and 891.8 MB in the end (delta: 64.6 MB). Peak memory consumption was 389.6 MB. Max. memory is 11.5 GB. [2019-11-25 17:58:54,230 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 17:58:54,231 INFO L168 Benchmark]: CACSL2BoogieTranslator took 704.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.0 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -192.8 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2019-11-25 17:58:54,231 INFO L168 Benchmark]: Boogie Preprocessor took 59.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-25 17:58:54,232 INFO L168 Benchmark]: RCFGBuilder took 692.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 11.5 GB. [2019-11-25 17:58:54,233 INFO L168 Benchmark]: TraceAbstraction took 9083.46 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 163.1 MB). Free memory was 1.1 GB in the beginning and 891.8 MB in the end (delta: 194.9 MB). Peak memory consumption was 358.0 MB. Max. memory is 11.5 GB. [2019-11-25 17:58:54,233 INFO L168 Benchmark]: Witness Printer took 76.36 ms. Allocated memory is still 1.4 GB. Free memory is still 891.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 17:58:54,241 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 704.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.0 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -192.8 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 59.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 692.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9083.46 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 163.1 MB). Free memory was 1.1 GB in the beginning and 891.8 MB in the end (delta: 194.9 MB). Peak memory consumption was 358.0 MB. Max. memory is 11.5 GB. * Witness Printer took 76.36 ms. Allocated memory is still 1.4 GB. Free memory is still 891.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 535]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 535]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 531]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 534]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 534]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 548]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 530]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 530]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 542]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 531]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 539]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 539]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 527]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 527]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 542]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 520]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 20 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 78 locations, 20 error locations. Result: SAFE, OverallTime: 9.0s, OverallIterations: 9, TraceHistogramMax: 3, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 290 SDtfs, 679 SDslu, 919 SDs, 0 SdLazy, 1964 SolverSat, 210 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 188 GetRequests, 66 SyntacticMatches, 4 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 65 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 254 NumberOfCodeBlocks, 254 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 243 ConstructedInterpolants, 11 QuantifiedInterpolants, 93365 SizeOfPredicates, 33 NumberOfNonLiveVariables, 345 ConjunctsInSsa, 78 ConjunctsInUnsatCore, 11 InterpolantComputations, 7 PerfectInterpolantSequences, 14/52 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...