./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/list-properties/list-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 30f4e4ab 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-properties/list-2.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 6439b1baef116d71fdff38c675a38b8a29c42257 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup) --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 02:48:09,047 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 02:48:09,051 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 02:48:09,068 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 02:48:09,068 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 02:48:09,069 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 02:48:09,070 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 02:48:09,072 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 02:48:09,074 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 02:48:09,075 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 02:48:09,076 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 02:48:09,077 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 02:48:09,077 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 02:48:09,080 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 02:48:09,081 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 02:48:09,083 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 02:48:09,086 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 02:48:09,087 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 02:48:09,088 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 02:48:09,090 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 02:48:09,092 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 02:48:09,093 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 02:48:09,094 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 02:48:09,095 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 02:48:09,097 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 02:48:09,098 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 02:48:09,098 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 02:48:09,099 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 02:48:09,099 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 02:48:09,100 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 02:48:09,101 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 02:48:09,101 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 02:48:09,102 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 02:48:09,103 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 02:48:09,104 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 02:48:09,104 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 02:48:09,105 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 02:48:09,105 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 02:48:09,105 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 02:48:09,106 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 02:48:09,107 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 02:48:09,108 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2019-11-28 02:48:09,123 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 02:48:09,123 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 02:48:09,124 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 02:48:09,124 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 02:48:09,125 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 02:48:09,125 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 02:48:09,125 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 02:48:09,125 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 02:48:09,126 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 02:48:09,126 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 02:48:09,126 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 02:48:09,126 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 02:48:09,126 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 02:48:09,127 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 02:48:09,127 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 02:48:09,127 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 02:48:09,127 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 02:48:09,128 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 02:48:09,128 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 02:48:09,128 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 02:48:09,128 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 02:48:09,129 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:48:09,129 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 02:48:09,129 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 02:48:09,129 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 02:48:09,130 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 02:48:09,130 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 -> 6439b1baef116d71fdff38c675a38b8a29c42257 [2019-11-28 02:48:09,491 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 02:48:09,518 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 02:48:09,522 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 02:48:09,525 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 02:48:09,525 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 02:48:09,526 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/list-2.i [2019-11-28 02:48:09,599 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7eed57dd/4b8097efb28a4b768e117b85f960a901/FLAG0585137f7 [2019-11-28 02:48:10,142 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 02:48:10,143 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list-2.i [2019-11-28 02:48:10,170 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7eed57dd/4b8097efb28a4b768e117b85f960a901/FLAG0585137f7 [2019-11-28 02:48:10,459 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7eed57dd/4b8097efb28a4b768e117b85f960a901 [2019-11-28 02:48:10,463 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 02:48:10,464 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 02:48:10,466 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 02:48:10,466 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 02:48:10,469 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 02:48:10,470 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:48:10" (1/1) ... [2019-11-28 02:48:10,473 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69e4995b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:48:10, skipping insertion in model container [2019-11-28 02:48:10,474 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:48:10" (1/1) ... [2019-11-28 02:48:10,480 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 02:48:10,532 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 02:48:10,906 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:48:10,919 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 02:48:10,994 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:48:11,057 INFO L208 MainTranslator]: Completed translation [2019-11-28 02:48:11,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:48:11 WrapperNode [2019-11-28 02:48:11,058 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 02:48:11,059 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 02:48:11,060 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 02:48:11,060 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 02:48:11,074 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:48:11" (1/1) ... [2019-11-28 02:48:11,074 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:48:11" (1/1) ... [2019-11-28 02:48:11,093 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:48:11" (1/1) ... [2019-11-28 02:48:11,093 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:48:11" (1/1) ... [2019-11-28 02:48:11,120 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:48:11" (1/1) ... [2019-11-28 02:48:11,125 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:48:11" (1/1) ... [2019-11-28 02:48:11,129 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:48:11" (1/1) ... [2019-11-28 02:48:11,135 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 02:48:11,136 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 02:48:11,136 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 02:48:11,136 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 02:48:11,137 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:48:11" (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-28 02:48:11,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 02:48:11,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 02:48:11,196 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-28 02:48:11,196 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-28 02:48:11,196 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-28 02:48:11,197 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-28 02:48:11,197 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-28 02:48:11,197 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-28 02:48:11,197 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 02:48:11,197 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-28 02:48:11,198 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-28 02:48:11,198 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-28 02:48:11,198 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-28 02:48:11,198 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-28 02:48:11,198 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-28 02:48:11,198 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-28 02:48:11,198 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-28 02:48:11,199 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-28 02:48:11,199 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-28 02:48:11,199 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-28 02:48:11,199 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-28 02:48:11,199 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-28 02:48:11,199 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-28 02:48:11,200 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-28 02:48:11,200 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-28 02:48:11,200 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-28 02:48:11,200 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-28 02:48:11,200 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-28 02:48:11,200 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-28 02:48:11,200 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-28 02:48:11,201 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-28 02:48:11,201 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-28 02:48:11,201 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-28 02:48:11,201 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-28 02:48:11,201 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-28 02:48:11,201 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-28 02:48:11,202 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-28 02:48:11,202 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-28 02:48:11,202 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-28 02:48:11,202 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-28 02:48:11,202 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-28 02:48:11,202 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-28 02:48:11,202 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-28 02:48:11,203 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-28 02:48:11,203 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-28 02:48:11,203 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-28 02:48:11,203 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-28 02:48:11,203 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-28 02:48:11,203 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-28 02:48:11,203 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-28 02:48:11,204 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-28 02:48:11,204 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-28 02:48:11,204 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-28 02:48:11,204 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-28 02:48:11,204 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-28 02:48:11,204 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-28 02:48:11,204 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-28 02:48:11,205 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-28 02:48:11,205 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-28 02:48:11,205 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-28 02:48:11,205 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-28 02:48:11,205 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-28 02:48:11,205 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-28 02:48:11,205 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-28 02:48:11,206 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-28 02:48:11,206 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-28 02:48:11,206 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-28 02:48:11,206 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-28 02:48:11,206 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-28 02:48:11,206 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-28 02:48:11,206 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-28 02:48:11,207 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-28 02:48:11,207 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-28 02:48:11,207 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-28 02:48:11,207 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-28 02:48:11,207 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-28 02:48:11,207 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-28 02:48:11,207 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-28 02:48:11,207 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-28 02:48:11,208 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-28 02:48:11,208 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-28 02:48:11,208 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-28 02:48:11,208 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-28 02:48:11,208 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-28 02:48:11,208 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-28 02:48:11,208 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-28 02:48:11,209 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-28 02:48:11,209 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-28 02:48:11,209 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-28 02:48:11,209 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-28 02:48:11,209 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-28 02:48:11,209 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-28 02:48:11,209 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-28 02:48:11,210 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-28 02:48:11,210 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-28 02:48:11,210 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-28 02:48:11,210 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-28 02:48:11,210 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-28 02:48:11,210 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-28 02:48:11,210 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-28 02:48:11,210 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-28 02:48:11,211 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-28 02:48:11,211 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-28 02:48:11,211 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-28 02:48:11,211 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-28 02:48:11,211 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-28 02:48:11,211 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-28 02:48:11,211 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-28 02:48:11,212 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-28 02:48:11,212 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-28 02:48:11,212 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-28 02:48:11,212 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-28 02:48:11,212 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-28 02:48:11,212 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-28 02:48:11,213 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-28 02:48:11,213 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-28 02:48:11,213 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-28 02:48:11,213 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-28 02:48:11,213 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-28 02:48:11,213 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 02:48:11,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 02:48:11,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 02:48:11,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 02:48:11,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 02:48:11,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 02:48:11,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 02:48:11,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 02:48:11,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 02:48:11,580 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-28 02:48:11,843 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 02:48:11,844 INFO L297 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 02:48:11,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:48:11 BoogieIcfgContainer [2019-11-28 02:48:11,845 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 02:48:11,847 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 02:48:11,847 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 02:48:11,850 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 02:48:11,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:48:10" (1/3) ... [2019-11-28 02:48:11,851 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5077404a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:48:11, skipping insertion in model container [2019-11-28 02:48:11,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:48:11" (2/3) ... [2019-11-28 02:48:11,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5077404a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:48:11, skipping insertion in model container [2019-11-28 02:48:11,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:48:11" (3/3) ... [2019-11-28 02:48:11,858 INFO L109 eAbstractionObserver]: Analyzing ICFG list-2.i [2019-11-28 02:48:11,870 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 02:48:11,883 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 26 error locations. [2019-11-28 02:48:11,896 INFO L249 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2019-11-28 02:48:11,921 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 02:48:11,924 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 02:48:11,924 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 02:48:11,924 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 02:48:11,925 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 02:48:11,925 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 02:48:11,925 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 02:48:11,925 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 02:48:11,940 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2019-11-28 02:48:11,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 02:48:11,949 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:48:11,950 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:48:11,951 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 02:48:11,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:48:11,956 INFO L82 PathProgramCache]: Analyzing trace with hash -516857152, now seen corresponding path program 1 times [2019-11-28 02:48:11,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:48:11,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44336577] [2019-11-28 02:48:11,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:48:12,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:12,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:12,162 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-28 02:48:12,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44336577] [2019-11-28 02:48:12,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:48:12,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:48:12,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946500654] [2019-11-28 02:48:12,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:48:12,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:48:12,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:48:12,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:48:12,203 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 3 states. [2019-11-28 02:48:12,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:48:12,399 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2019-11-28 02:48:12,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:48:12,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-28 02:48:12,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:48:12,410 INFO L225 Difference]: With dead ends: 73 [2019-11-28 02:48:12,410 INFO L226 Difference]: Without dead ends: 65 [2019-11-28 02:48:12,412 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-28 02:48:12,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-28 02:48:12,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-11-28 02:48:12,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-28 02:48:12,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2019-11-28 02:48:12,463 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 11 [2019-11-28 02:48:12,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:48:12,464 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2019-11-28 02:48:12,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:48:12,465 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2019-11-28 02:48:12,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 02:48:12,465 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:48:12,466 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:48:12,466 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 02:48:12,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:48:12,467 INFO L82 PathProgramCache]: Analyzing trace with hash -516882778, now seen corresponding path program 1 times [2019-11-28 02:48:12,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:48:12,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415267801] [2019-11-28 02:48:12,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:48:12,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:12,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:12,579 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-28 02:48:12,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415267801] [2019-11-28 02:48:12,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:48:12,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 02:48:12,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361803940] [2019-11-28 02:48:12,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:48:12,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:48:12,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:48:12,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:48:12,586 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand 5 states. [2019-11-28 02:48:12,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:48:12,802 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2019-11-28 02:48:12,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:48:12,803 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-28 02:48:12,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:48:12,806 INFO L225 Difference]: With dead ends: 72 [2019-11-28 02:48:12,806 INFO L226 Difference]: Without dead ends: 72 [2019-11-28 02:48:12,808 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-28 02:48:12,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-28 02:48:12,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 67. [2019-11-28 02:48:12,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-28 02:48:12,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 77 transitions. [2019-11-28 02:48:12,821 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 77 transitions. Word has length 11 [2019-11-28 02:48:12,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:48:12,823 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 77 transitions. [2019-11-28 02:48:12,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:48:12,823 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 77 transitions. [2019-11-28 02:48:12,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 02:48:12,825 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:48:12,825 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:48:12,825 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 02:48:12,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:48:12,826 INFO L82 PathProgramCache]: Analyzing trace with hash -516882777, now seen corresponding path program 1 times [2019-11-28 02:48:12,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:48:12,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185828565] [2019-11-28 02:48:12,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:48:12,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:12,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:12,949 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-28 02:48:12,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185828565] [2019-11-28 02:48:12,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:48:12,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 02:48:12,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122567522] [2019-11-28 02:48:12,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:48:12,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:48:12,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:48:12,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:48:12,952 INFO L87 Difference]: Start difference. First operand 67 states and 77 transitions. Second operand 5 states. [2019-11-28 02:48:13,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:48:13,171 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2019-11-28 02:48:13,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:48:13,172 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-28 02:48:13,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:48:13,173 INFO L225 Difference]: With dead ends: 92 [2019-11-28 02:48:13,173 INFO L226 Difference]: Without dead ends: 92 [2019-11-28 02:48:13,174 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-28 02:48:13,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-28 02:48:13,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 81. [2019-11-28 02:48:13,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-28 02:48:13,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2019-11-28 02:48:13,184 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 11 [2019-11-28 02:48:13,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:48:13,184 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2019-11-28 02:48:13,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:48:13,185 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2019-11-28 02:48:13,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 02:48:13,186 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:48:13,186 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-28 02:48:13,186 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 02:48:13,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:48:13,187 INFO L82 PathProgramCache]: Analyzing trace with hash -725497357, now seen corresponding path program 1 times [2019-11-28 02:48:13,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:48:13,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494158770] [2019-11-28 02:48:13,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:48:13,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:13,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:13,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:48:13,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494158770] [2019-11-28 02:48:13,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:48:13,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 02:48:13,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698804468] [2019-11-28 02:48:13,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:48:13,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:48:13,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:48:13,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:48:13,310 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 7 states. [2019-11-28 02:48:13,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:48:13,598 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2019-11-28 02:48:13,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 02:48:13,598 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-11-28 02:48:13,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:48:13,600 INFO L225 Difference]: With dead ends: 120 [2019-11-28 02:48:13,600 INFO L226 Difference]: Without dead ends: 120 [2019-11-28 02:48:13,601 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:48:13,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-28 02:48:13,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 84. [2019-11-28 02:48:13,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-28 02:48:13,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2019-11-28 02:48:13,610 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 19 [2019-11-28 02:48:13,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:48:13,611 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2019-11-28 02:48:13,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:48:13,611 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2019-11-28 02:48:13,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 02:48:13,612 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:48:13,612 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:48:13,613 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 02:48:13,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:48:13,613 INFO L82 PathProgramCache]: Analyzing trace with hash 538341657, now seen corresponding path program 1 times [2019-11-28 02:48:13,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:48:13,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531018061] [2019-11-28 02:48:13,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:48:13,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:13,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:13,728 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-28 02:48:13,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531018061] [2019-11-28 02:48:13,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:48:13,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 02:48:13,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942300819] [2019-11-28 02:48:13,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:48:13,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:48:13,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:48:13,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:48:13,732 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand 7 states. [2019-11-28 02:48:14,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:48:14,077 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2019-11-28 02:48:14,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 02:48:14,078 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-11-28 02:48:14,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:48:14,081 INFO L225 Difference]: With dead ends: 109 [2019-11-28 02:48:14,081 INFO L226 Difference]: Without dead ends: 109 [2019-11-28 02:48:14,081 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-28 02:48:14,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-28 02:48:14,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 87. [2019-11-28 02:48:14,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-28 02:48:14,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 98 transitions. [2019-11-28 02:48:14,089 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 98 transitions. Word has length 19 [2019-11-28 02:48:14,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:48:14,090 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 98 transitions. [2019-11-28 02:48:14,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:48:14,090 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 98 transitions. [2019-11-28 02:48:14,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 02:48:14,091 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:48:14,091 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:48:14,091 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 02:48:14,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:48:14,092 INFO L82 PathProgramCache]: Analyzing trace with hash 538341658, now seen corresponding path program 1 times [2019-11-28 02:48:14,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:48:14,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748381217] [2019-11-28 02:48:14,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:48:14,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:14,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:14,195 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-28 02:48:14,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748381217] [2019-11-28 02:48:14,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:48:14,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 02:48:14,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068463965] [2019-11-28 02:48:14,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:48:14,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:48:14,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:48:14,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:48:14,198 INFO L87 Difference]: Start difference. First operand 87 states and 98 transitions. Second operand 7 states. [2019-11-28 02:48:14,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:48:14,694 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions. [2019-11-28 02:48:14,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 02:48:14,695 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-11-28 02:48:14,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:48:14,696 INFO L225 Difference]: With dead ends: 110 [2019-11-28 02:48:14,696 INFO L226 Difference]: Without dead ends: 110 [2019-11-28 02:48:14,697 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-28 02:48:14,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-11-28 02:48:14,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 78. [2019-11-28 02:48:14,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-28 02:48:14,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2019-11-28 02:48:14,706 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 19 [2019-11-28 02:48:14,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:48:14,706 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2019-11-28 02:48:14,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:48:14,711 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2019-11-28 02:48:14,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 02:48:14,712 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:48:14,712 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:48:14,713 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 02:48:14,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:48:14,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1465888843, now seen corresponding path program 1 times [2019-11-28 02:48:14,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:48:14,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596705595] [2019-11-28 02:48:14,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:48:14,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:14,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:14,818 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-28 02:48:14,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596705595] [2019-11-28 02:48:14,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:48:14,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 02:48:14,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244184974] [2019-11-28 02:48:14,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:48:14,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:48:14,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:48:14,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:48:14,822 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand 7 states. [2019-11-28 02:48:15,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:48:15,048 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2019-11-28 02:48:15,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 02:48:15,050 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-11-28 02:48:15,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:48:15,051 INFO L225 Difference]: With dead ends: 122 [2019-11-28 02:48:15,051 INFO L226 Difference]: Without dead ends: 122 [2019-11-28 02:48:15,052 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:48:15,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-11-28 02:48:15,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 82. [2019-11-28 02:48:15,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-28 02:48:15,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2019-11-28 02:48:15,059 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 21 [2019-11-28 02:48:15,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:48:15,059 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2019-11-28 02:48:15,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:48:15,060 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2019-11-28 02:48:15,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 02:48:15,061 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:48:15,061 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:48:15,061 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 02:48:15,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:48:15,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1465836288, now seen corresponding path program 1 times [2019-11-28 02:48:15,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:48:15,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360136354] [2019-11-28 02:48:15,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:48:15,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:15,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:15,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:48:15,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360136354] [2019-11-28 02:48:15,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:48:15,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 02:48:15,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121969357] [2019-11-28 02:48:15,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:48:15,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:48:15,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:48:15,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:48:15,122 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 7 states. [2019-11-28 02:48:15,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:48:15,341 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2019-11-28 02:48:15,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:48:15,341 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-11-28 02:48:15,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:48:15,342 INFO L225 Difference]: With dead ends: 105 [2019-11-28 02:48:15,342 INFO L226 Difference]: Without dead ends: 105 [2019-11-28 02:48:15,342 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:48:15,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-28 02:48:15,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 82. [2019-11-28 02:48:15,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-28 02:48:15,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2019-11-28 02:48:15,348 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 21 [2019-11-28 02:48:15,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:48:15,348 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2019-11-28 02:48:15,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:48:15,348 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2019-11-28 02:48:15,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 02:48:15,349 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:48:15,349 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-28 02:48:15,350 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 02:48:15,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:48:15,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1761650517, now seen corresponding path program 1 times [2019-11-28 02:48:15,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:48:15,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131239393] [2019-11-28 02:48:15,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:48:15,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:15,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:15,407 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-28 02:48:15,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131239393] [2019-11-28 02:48:15,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:48:15,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 02:48:15,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188510895] [2019-11-28 02:48:15,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:48:15,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:48:15,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:48:15,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:48:15,409 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand 7 states. [2019-11-28 02:48:15,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:48:15,641 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2019-11-28 02:48:15,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 02:48:15,641 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-11-28 02:48:15,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:48:15,645 INFO L225 Difference]: With dead ends: 88 [2019-11-28 02:48:15,645 INFO L226 Difference]: Without dead ends: 88 [2019-11-28 02:48:15,645 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-28 02:48:15,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-11-28 02:48:15,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 80. [2019-11-28 02:48:15,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-28 02:48:15,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2019-11-28 02:48:15,652 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 21 [2019-11-28 02:48:15,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:48:15,652 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2019-11-28 02:48:15,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:48:15,653 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2019-11-28 02:48:15,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 02:48:15,653 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:48:15,654 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-28 02:48:15,654 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 02:48:15,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:48:15,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1761650516, now seen corresponding path program 1 times [2019-11-28 02:48:15,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:48:15,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127436287] [2019-11-28 02:48:15,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:48:15,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:15,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:15,727 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-28 02:48:15,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127436287] [2019-11-28 02:48:15,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:48:15,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 02:48:15,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953183287] [2019-11-28 02:48:15,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:48:15,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:48:15,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:48:15,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:48:15,729 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand 7 states. [2019-11-28 02:48:16,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:48:16,102 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2019-11-28 02:48:16,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 02:48:16,102 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-11-28 02:48:16,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:48:16,103 INFO L225 Difference]: With dead ends: 85 [2019-11-28 02:48:16,103 INFO L226 Difference]: Without dead ends: 85 [2019-11-28 02:48:16,104 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-28 02:48:16,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-11-28 02:48:16,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 68. [2019-11-28 02:48:16,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-28 02:48:16,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2019-11-28 02:48:16,107 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 21 [2019-11-28 02:48:16,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:48:16,108 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2019-11-28 02:48:16,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:48:16,108 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2019-11-28 02:48:16,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 02:48:16,109 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:48:16,109 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:48:16,109 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 02:48:16,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:48:16,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1802091221, now seen corresponding path program 1 times [2019-11-28 02:48:16,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:48:16,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465082456] [2019-11-28 02:48:16,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:48:16,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:48:16,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:48:16,167 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:48:16,168 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 02:48:16,181 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-11-28 02:48:16,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:48:16 BoogieIcfgContainer [2019-11-28 02:48:16,196 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 02:48:16,196 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 02:48:16,196 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 02:48:16,197 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 02:48:16,197 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:48:11" (3/4) ... [2019-11-28 02:48:16,199 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 02:48:16,203 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-11-28 02:48:16,248 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 02:48:16,249 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 02:48:16,251 INFO L168 Benchmark]: Toolchain (without parser) took 5786.36 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 224.9 MB). Free memory was 957.7 MB in the beginning and 1.0 GB in the end (delta: -45.8 MB). Peak memory consumption was 179.1 MB. Max. memory is 11.5 GB. [2019-11-28 02:48:16,252 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:48:16,253 INFO L168 Benchmark]: CACSL2BoogieTranslator took 593.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -186.9 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-28 02:48:16,254 INFO L168 Benchmark]: Boogie Preprocessor took 76.04 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-28 02:48:16,255 INFO L168 Benchmark]: RCFGBuilder took 709.93 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.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 11.5 GB. [2019-11-28 02:48:16,260 INFO L168 Benchmark]: TraceAbstraction took 4349.24 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 67.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 79.2 MB). Peak memory consumption was 146.9 MB. Max. memory is 11.5 GB. [2019-11-28 02:48:16,262 INFO L168 Benchmark]: Witness Printer took 52.76 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:48:16,267 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 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 593.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -186.9 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 76.04 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 709.93 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.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4349.24 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 67.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 79.2 MB). Peak memory consumption was 146.9 MB. Max. memory is 11.5 GB. * Witness Printer took 52.76 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 520]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L521] List a = (List) malloc(sizeof(struct node)); VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}] [L522] COND FALSE !(a == 0) VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}] [L523] List t; [L524] List p = a; VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L525] COND FALSE !(__VERIFIER_nondet_int()) [L532] COND FALSE !(__VERIFIER_nondet_int()) [L539] p->h = 3 VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L540] p = a VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L541] EXPR p->h VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, p->h=3] [L541] COND FALSE !(p->h == 2) [L543] EXPR p->h VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, p->h=3] [L543] COND FALSE !(p->h == 1) [L545] EXPR p->h VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, p->h=3] [L545] COND FALSE !(p->h != 3) [L547] return 0; VAL [\result=0, a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 89 locations, 26 error locations. Result: UNSAFE, OverallTime: 4.2s, OverallIterations: 11, TraceHistogramMax: 2, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 463 SDtfs, 689 SDslu, 939 SDs, 0 SdLazy, 1838 SolverSat, 121 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 194 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 196 NumberOfCodeBlocks, 196 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 164 ConstructedInterpolants, 0 QuantifiedInterpolants, 12096 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 12/12 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 incorrect! Received shutdown request...