./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/forester-heap/dll-circular-1.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/forester-heap/dll-circular-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 95b20088216028e3d05e3cb41d4ed5c20af6a751 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup) --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 02:47:30,987 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 02:47:30,990 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 02:47:31,008 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 02:47:31,008 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 02:47:31,011 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 02:47:31,013 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 02:47:31,026 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 02:47:31,030 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 02:47:31,032 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 02:47:31,034 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 02:47:31,037 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 02:47:31,037 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 02:47:31,041 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 02:47:31,043 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 02:47:31,045 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 02:47:31,046 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 02:47:31,047 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 02:47:31,049 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 02:47:31,051 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 02:47:31,053 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 02:47:31,054 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 02:47:31,056 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 02:47:31,057 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 02:47:31,059 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 02:47:31,059 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 02:47:31,059 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 02:47:31,061 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 02:47:31,061 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 02:47:31,062 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 02:47:31,063 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 02:47:31,064 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 02:47:31,064 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 02:47:31,065 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 02:47:31,066 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 02:47:31,067 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 02:47:31,068 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 02:47:31,068 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 02:47:31,068 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 02:47:31,069 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 02:47:31,070 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 02:47:31,071 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:47:31,090 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 02:47:31,091 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 02:47:31,092 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 02:47:31,092 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 02:47:31,093 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 02:47:31,093 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 02:47:31,093 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 02:47:31,094 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 02:47:31,094 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 02:47:31,094 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 02:47:31,095 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 02:47:31,095 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 02:47:31,095 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 02:47:31,095 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 02:47:31,096 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 02:47:31,096 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 02:47:31,096 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 02:47:31,096 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 02:47:31,097 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 02:47:31,097 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 02:47:31,097 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 02:47:31,098 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:47:31,098 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 02:47:31,098 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 02:47:31,099 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 02:47:31,099 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 02:47:31,099 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 95b20088216028e3d05e3cb41d4ed5c20af6a751 [2019-11-28 02:47:31,445 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 02:47:31,465 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 02:47:31,469 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 02:47:31,470 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 02:47:31,472 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 02:47:31,473 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-circular-1.i [2019-11-28 02:47:31,537 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c51fd0f30/38a1f224caf84fa9944545dbe4770f16/FLAG70443ecd1 [2019-11-28 02:47:32,093 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 02:47:32,094 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-1.i [2019-11-28 02:47:32,105 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c51fd0f30/38a1f224caf84fa9944545dbe4770f16/FLAG70443ecd1 [2019-11-28 02:47:32,392 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c51fd0f30/38a1f224caf84fa9944545dbe4770f16 [2019-11-28 02:47:32,395 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 02:47:32,398 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 02:47:32,399 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 02:47:32,399 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 02:47:32,402 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 02:47:32,403 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:47:32" (1/1) ... [2019-11-28 02:47:32,406 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ff623f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:32, skipping insertion in model container [2019-11-28 02:47:32,406 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:47:32" (1/1) ... [2019-11-28 02:47:32,412 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 02:47:32,455 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 02:47:32,894 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:47:32,910 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 02:47:32,981 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:47:33,030 INFO L208 MainTranslator]: Completed translation [2019-11-28 02:47:33,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:33 WrapperNode [2019-11-28 02:47:33,031 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 02:47:33,032 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 02:47:33,032 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 02:47:33,032 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 02:47:33,048 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:33" (1/1) ... [2019-11-28 02:47:33,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:33" (1/1) ... [2019-11-28 02:47:33,070 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:33" (1/1) ... [2019-11-28 02:47:33,070 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:33" (1/1) ... [2019-11-28 02:47:33,088 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:33" (1/1) ... [2019-11-28 02:47:33,095 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:33" (1/1) ... [2019-11-28 02:47:33,099 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:33" (1/1) ... [2019-11-28 02:47:33,105 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 02:47:33,106 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 02:47:33,106 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 02:47:33,107 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 02:47:33,108 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:33" (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:47:33,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 02:47:33,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 02:47:33,166 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 02:47:33,166 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-28 02:47:33,166 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-28 02:47:33,167 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-28 02:47:33,167 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-28 02:47:33,167 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-28 02:47:33,167 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-28 02:47:33,168 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-28 02:47:33,168 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-28 02:47:33,168 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-28 02:47:33,168 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-28 02:47:33,169 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-28 02:47:33,169 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-28 02:47:33,169 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-28 02:47:33,169 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-28 02:47:33,170 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-28 02:47:33,170 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-28 02:47:33,170 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-28 02:47:33,170 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-28 02:47:33,170 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-28 02:47:33,171 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-28 02:47:33,171 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-28 02:47:33,171 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-28 02:47:33,171 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-28 02:47:33,172 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-28 02:47:33,172 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-28 02:47:33,172 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-28 02:47:33,172 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-28 02:47:33,173 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-28 02:47:33,173 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-28 02:47:33,173 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-28 02:47:33,173 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-28 02:47:33,174 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-28 02:47:33,174 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-28 02:47:33,174 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-28 02:47:33,174 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-28 02:47:33,175 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-28 02:47:33,175 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-28 02:47:33,175 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-28 02:47:33,175 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-28 02:47:33,175 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-28 02:47:33,176 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-28 02:47:33,176 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-28 02:47:33,176 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-28 02:47:33,176 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-28 02:47:33,177 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-28 02:47:33,177 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-28 02:47:33,177 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-28 02:47:33,177 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-28 02:47:33,177 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-28 02:47:33,178 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-28 02:47:33,178 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-28 02:47:33,178 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-28 02:47:33,178 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-28 02:47:33,178 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-28 02:47:33,179 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-28 02:47:33,179 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-28 02:47:33,179 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-28 02:47:33,179 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-28 02:47:33,180 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-28 02:47:33,180 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-28 02:47:33,180 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-28 02:47:33,180 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-28 02:47:33,180 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-28 02:47:33,180 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-28 02:47:33,181 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-28 02:47:33,181 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-28 02:47:33,181 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-28 02:47:33,181 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-28 02:47:33,182 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-28 02:47:33,182 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-28 02:47:33,182 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-28 02:47:33,182 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-28 02:47:33,182 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-28 02:47:33,183 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-28 02:47:33,183 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-28 02:47:33,183 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-28 02:47:33,183 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-28 02:47:33,183 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-28 02:47:33,184 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-28 02:47:33,184 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-28 02:47:33,184 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-28 02:47:33,184 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-28 02:47:33,185 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-28 02:47:33,185 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-28 02:47:33,185 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-28 02:47:33,185 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-28 02:47:33,185 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-28 02:47:33,186 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-28 02:47:33,186 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-28 02:47:33,186 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-28 02:47:33,186 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-28 02:47:33,186 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-28 02:47:33,187 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-28 02:47:33,187 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-28 02:47:33,187 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-28 02:47:33,187 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-28 02:47:33,187 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-28 02:47:33,188 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-28 02:47:33,188 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-28 02:47:33,188 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-28 02:47:33,188 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-28 02:47:33,188 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-28 02:47:33,189 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-28 02:47:33,189 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-28 02:47:33,189 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-28 02:47:33,189 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 02:47:33,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 02:47:33,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 02:47:33,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 02:47:33,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 02:47:33,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 02:47:33,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 02:47:33,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 02:47:33,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 02:47:33,904 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 02:47:33,904 INFO L297 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-28 02:47:33,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:47:33 BoogieIcfgContainer [2019-11-28 02:47:33,906 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 02:47:33,907 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 02:47:33,907 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 02:47:33,910 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 02:47:33,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:47:32" (1/3) ... [2019-11-28 02:47:33,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ccc606c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:47:33, skipping insertion in model container [2019-11-28 02:47:33,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:33" (2/3) ... [2019-11-28 02:47:33,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ccc606c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:47:33, skipping insertion in model container [2019-11-28 02:47:33,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:47:33" (3/3) ... [2019-11-28 02:47:33,914 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-circular-1.i [2019-11-28 02:47:33,925 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 02:47:33,933 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 50 error locations. [2019-11-28 02:47:33,946 INFO L249 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2019-11-28 02:47:33,967 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 02:47:33,968 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 02:47:33,968 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 02:47:33,969 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 02:47:33,969 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 02:47:33,969 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 02:47:33,969 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 02:47:33,970 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 02:47:33,991 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2019-11-28 02:47:34,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-28 02:47:34,001 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:34,002 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:34,003 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 02:47:34,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:34,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1524629102, now seen corresponding path program 1 times [2019-11-28 02:47:34,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:34,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523045031] [2019-11-28 02:47:34,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:34,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:34,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:34,215 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:47:34,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523045031] [2019-11-28 02:47:34,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:34,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:47:34,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619117672] [2019-11-28 02:47:34,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:47:34,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:34,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:47:34,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:47:34,257 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 4 states. [2019-11-28 02:47:34,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:34,607 INFO L93 Difference]: Finished difference Result 119 states and 126 transitions. [2019-11-28 02:47:34,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:47:34,610 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-28 02:47:34,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:34,624 INFO L225 Difference]: With dead ends: 119 [2019-11-28 02:47:34,625 INFO L226 Difference]: Without dead ends: 116 [2019-11-28 02:47:34,628 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:47:34,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-28 02:47:34,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 106. [2019-11-28 02:47:34,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-28 02:47:34,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 112 transitions. [2019-11-28 02:47:34,685 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 112 transitions. Word has length 7 [2019-11-28 02:47:34,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:34,686 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 112 transitions. [2019-11-28 02:47:34,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:47:34,686 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 112 transitions. [2019-11-28 02:47:34,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-28 02:47:34,687 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:34,687 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:34,688 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 02:47:34,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:34,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1524629103, now seen corresponding path program 1 times [2019-11-28 02:47:34,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:34,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308175300] [2019-11-28 02:47:34,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:34,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:34,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:34,787 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:47:34,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308175300] [2019-11-28 02:47:34,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:34,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:47:34,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846466779] [2019-11-28 02:47:34,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:47:34,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:34,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:47:34,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:47:34,792 INFO L87 Difference]: Start difference. First operand 106 states and 112 transitions. Second operand 4 states. [2019-11-28 02:47:35,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:35,042 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2019-11-28 02:47:35,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:47:35,044 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-28 02:47:35,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:35,046 INFO L225 Difference]: With dead ends: 114 [2019-11-28 02:47:35,047 INFO L226 Difference]: Without dead ends: 114 [2019-11-28 02:47:35,048 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:47:35,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-28 02:47:35,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 102. [2019-11-28 02:47:35,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-28 02:47:35,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2019-11-28 02:47:35,065 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 7 [2019-11-28 02:47:35,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:35,070 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2019-11-28 02:47:35,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:47:35,071 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2019-11-28 02:47:35,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 02:47:35,071 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:35,071 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:35,072 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 02:47:35,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:35,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1043867395, now seen corresponding path program 1 times [2019-11-28 02:47:35,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:35,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061891158] [2019-11-28 02:47:35,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:35,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:35,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:35,199 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:47:35,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061891158] [2019-11-28 02:47:35,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:35,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 02:47:35,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591687507] [2019-11-28 02:47:35,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:47:35,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:35,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:47:35,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:47:35,205 INFO L87 Difference]: Start difference. First operand 102 states and 108 transitions. Second operand 5 states. [2019-11-28 02:47:35,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:35,489 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2019-11-28 02:47:35,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:47:35,491 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-28 02:47:35,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:35,493 INFO L225 Difference]: With dead ends: 99 [2019-11-28 02:47:35,493 INFO L226 Difference]: Without dead ends: 99 [2019-11-28 02:47:35,493 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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:47:35,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-28 02:47:35,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 90. [2019-11-28 02:47:35,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-28 02:47:35,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2019-11-28 02:47:35,510 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 12 [2019-11-28 02:47:35,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:35,511 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2019-11-28 02:47:35,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:47:35,511 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2019-11-28 02:47:35,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 02:47:35,512 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:35,512 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:35,512 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 02:47:35,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:35,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1043867394, now seen corresponding path program 1 times [2019-11-28 02:47:35,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:35,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898120309] [2019-11-28 02:47:35,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:35,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:35,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:35,628 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:47:35,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898120309] [2019-11-28 02:47:35,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:35,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 02:47:35,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5894090] [2019-11-28 02:47:35,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:47:35,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:35,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:47:35,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:47:35,635 INFO L87 Difference]: Start difference. First operand 90 states and 96 transitions. Second operand 5 states. [2019-11-28 02:47:35,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:35,920 INFO L93 Difference]: Finished difference Result 114 states and 121 transitions. [2019-11-28 02:47:35,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:47:35,921 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-28 02:47:35,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:35,923 INFO L225 Difference]: With dead ends: 114 [2019-11-28 02:47:35,923 INFO L226 Difference]: Without dead ends: 114 [2019-11-28 02:47:35,923 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:47:35,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-28 02:47:35,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 98. [2019-11-28 02:47:35,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-28 02:47:35,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2019-11-28 02:47:35,933 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 12 [2019-11-28 02:47:35,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:35,934 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2019-11-28 02:47:35,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:47:35,934 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2019-11-28 02:47:35,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 02:47:35,935 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:35,935 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:35,936 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 02:47:35,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:35,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1865783331, now seen corresponding path program 1 times [2019-11-28 02:47:35,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:35,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483526487] [2019-11-28 02:47:35,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:35,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:35,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:36,002 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:47:36,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483526487] [2019-11-28 02:47:36,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:36,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 02:47:36,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429880753] [2019-11-28 02:47:36,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:47:36,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:36,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:47:36,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:47:36,005 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand 6 states. [2019-11-28 02:47:36,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:36,408 INFO L93 Difference]: Finished difference Result 148 states and 159 transitions. [2019-11-28 02:47:36,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:47:36,409 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-11-28 02:47:36,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:36,410 INFO L225 Difference]: With dead ends: 148 [2019-11-28 02:47:36,411 INFO L226 Difference]: Without dead ends: 148 [2019-11-28 02:47:36,411 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:47:36,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-11-28 02:47:36,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 97. [2019-11-28 02:47:36,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-28 02:47:36,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2019-11-28 02:47:36,419 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 14 [2019-11-28 02:47:36,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:36,420 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2019-11-28 02:47:36,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:47:36,420 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2019-11-28 02:47:36,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 02:47:36,421 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:36,421 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:36,422 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 02:47:36,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:36,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1865783332, now seen corresponding path program 1 times [2019-11-28 02:47:36,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:36,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496522048] [2019-11-28 02:47:36,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:36,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:36,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:36,530 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:47:36,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496522048] [2019-11-28 02:47:36,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:36,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 02:47:36,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818021178] [2019-11-28 02:47:36,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:47:36,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:36,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:47:36,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:47:36,532 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand 6 states. [2019-11-28 02:47:37,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:37,046 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions. [2019-11-28 02:47:37,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:47:37,047 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-11-28 02:47:37,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:37,049 INFO L225 Difference]: With dead ends: 149 [2019-11-28 02:47:37,049 INFO L226 Difference]: Without dead ends: 149 [2019-11-28 02:47:37,050 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:47:37,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-28 02:47:37,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 96. [2019-11-28 02:47:37,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-28 02:47:37,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2019-11-28 02:47:37,058 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 14 [2019-11-28 02:47:37,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:37,059 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2019-11-28 02:47:37,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:47:37,059 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2019-11-28 02:47:37,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 02:47:37,060 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:37,060 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:37,061 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 02:47:37,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:37,061 INFO L82 PathProgramCache]: Analyzing trace with hash 2015464416, now seen corresponding path program 1 times [2019-11-28 02:47:37,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:37,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809501775] [2019-11-28 02:47:37,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:37,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:37,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:37,221 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:47:37,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809501775] [2019-11-28 02:47:37,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:37,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 02:47:37,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540208410] [2019-11-28 02:47:37,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 02:47:37,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:37,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 02:47:37,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:47:37,224 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand 9 states. [2019-11-28 02:47:37,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:37,699 INFO L93 Difference]: Finished difference Result 179 states and 190 transitions. [2019-11-28 02:47:37,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 02:47:37,699 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-11-28 02:47:37,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:37,700 INFO L225 Difference]: With dead ends: 179 [2019-11-28 02:47:37,700 INFO L226 Difference]: Without dead ends: 179 [2019-11-28 02:47:37,701 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-11-28 02:47:37,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-11-28 02:47:37,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 99. [2019-11-28 02:47:37,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-28 02:47:37,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2019-11-28 02:47:37,707 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 16 [2019-11-28 02:47:37,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:37,708 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2019-11-28 02:47:37,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 02:47:37,708 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2019-11-28 02:47:37,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 02:47:37,709 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:37,709 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:37,710 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 02:47:37,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:37,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1945108375, now seen corresponding path program 1 times [2019-11-28 02:47:37,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:37,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779190708] [2019-11-28 02:47:37,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:37,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:37,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:37,858 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:47:37,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779190708] [2019-11-28 02:47:37,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:37,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 02:47:37,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12691491] [2019-11-28 02:47:37,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 02:47:37,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:37,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 02:47:37,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:47:37,861 INFO L87 Difference]: Start difference. First operand 99 states and 106 transitions. Second operand 9 states. [2019-11-28 02:47:38,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:38,293 INFO L93 Difference]: Finished difference Result 141 states and 150 transitions. [2019-11-28 02:47:38,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 02:47:38,294 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2019-11-28 02:47:38,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:38,295 INFO L225 Difference]: With dead ends: 141 [2019-11-28 02:47:38,295 INFO L226 Difference]: Without dead ends: 141 [2019-11-28 02:47:38,296 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-11-28 02:47:38,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-11-28 02:47:38,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 101. [2019-11-28 02:47:38,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-28 02:47:38,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2019-11-28 02:47:38,303 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 17 [2019-11-28 02:47:38,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:38,303 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2019-11-28 02:47:38,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 02:47:38,303 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2019-11-28 02:47:38,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 02:47:38,304 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:38,304 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:38,305 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 02:47:38,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:38,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1945108374, now seen corresponding path program 1 times [2019-11-28 02:47:38,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:38,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115169732] [2019-11-28 02:47:38,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:38,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:38,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:38,469 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:47:38,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115169732] [2019-11-28 02:47:38,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:38,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 02:47:38,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334872957] [2019-11-28 02:47:38,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 02:47:38,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:38,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 02:47:38,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:47:38,472 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand 9 states. [2019-11-28 02:47:39,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:39,036 INFO L93 Difference]: Finished difference Result 173 states and 184 transitions. [2019-11-28 02:47:39,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 02:47:39,037 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2019-11-28 02:47:39,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:39,038 INFO L225 Difference]: With dead ends: 173 [2019-11-28 02:47:39,038 INFO L226 Difference]: Without dead ends: 173 [2019-11-28 02:47:39,039 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-11-28 02:47:39,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-11-28 02:47:39,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 113. [2019-11-28 02:47:39,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-28 02:47:39,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 127 transitions. [2019-11-28 02:47:39,045 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 127 transitions. Word has length 17 [2019-11-28 02:47:39,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:39,045 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 127 transitions. [2019-11-28 02:47:39,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 02:47:39,046 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2019-11-28 02:47:39,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 02:47:39,046 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:39,047 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:39,047 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 02:47:39,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:39,048 INFO L82 PathProgramCache]: Analyzing trace with hash 748051109, now seen corresponding path program 1 times [2019-11-28 02:47:39,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:39,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366625274] [2019-11-28 02:47:39,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:39,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:39,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:39,185 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:47:39,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366625274] [2019-11-28 02:47:39,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:39,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 02:47:39,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037499686] [2019-11-28 02:47:39,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 02:47:39,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:39,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 02:47:39,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:47:39,189 INFO L87 Difference]: Start difference. First operand 113 states and 127 transitions. Second operand 10 states. [2019-11-28 02:47:39,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:39,766 INFO L93 Difference]: Finished difference Result 121 states and 136 transitions. [2019-11-28 02:47:39,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 02:47:39,767 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-11-28 02:47:39,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:39,769 INFO L225 Difference]: With dead ends: 121 [2019-11-28 02:47:39,769 INFO L226 Difference]: Without dead ends: 121 [2019-11-28 02:47:39,769 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-11-28 02:47:39,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-11-28 02:47:39,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 112. [2019-11-28 02:47:39,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-28 02:47:39,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 126 transitions. [2019-11-28 02:47:39,775 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 126 transitions. Word has length 18 [2019-11-28 02:47:39,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:39,775 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 126 transitions. [2019-11-28 02:47:39,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 02:47:39,776 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 126 transitions. [2019-11-28 02:47:39,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 02:47:39,777 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:39,777 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:39,778 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 02:47:39,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:39,778 INFO L82 PathProgramCache]: Analyzing trace with hash 748051110, now seen corresponding path program 1 times [2019-11-28 02:47:39,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:39,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193166259] [2019-11-28 02:47:39,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:39,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:39,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:39,951 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:47:39,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193166259] [2019-11-28 02:47:39,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:39,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-28 02:47:39,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612404816] [2019-11-28 02:47:39,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 02:47:39,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:39,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 02:47:39,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-28 02:47:39,954 INFO L87 Difference]: Start difference. First operand 112 states and 126 transitions. Second operand 11 states. [2019-11-28 02:47:40,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:40,768 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2019-11-28 02:47:40,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 02:47:40,769 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2019-11-28 02:47:40,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:40,771 INFO L225 Difference]: With dead ends: 116 [2019-11-28 02:47:40,771 INFO L226 Difference]: Without dead ends: 116 [2019-11-28 02:47:40,772 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-11-28 02:47:40,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-28 02:47:40,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 101. [2019-11-28 02:47:40,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-28 02:47:40,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 115 transitions. [2019-11-28 02:47:40,777 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 115 transitions. Word has length 18 [2019-11-28 02:47:40,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:40,777 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 115 transitions. [2019-11-28 02:47:40,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 02:47:40,778 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 115 transitions. [2019-11-28 02:47:40,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 02:47:40,778 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:40,779 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] [2019-11-28 02:47:40,779 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 02:47:40,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:40,780 INFO L82 PathProgramCache]: Analyzing trace with hash 975241550, now seen corresponding path program 1 times [2019-11-28 02:47:40,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:40,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647926929] [2019-11-28 02:47:40,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:40,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:40,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:40,922 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:47:40,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647926929] [2019-11-28 02:47:40,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:40,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 02:47:40,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131627119] [2019-11-28 02:47:40,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 02:47:40,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:40,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 02:47:40,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:47:40,925 INFO L87 Difference]: Start difference. First operand 101 states and 115 transitions. Second operand 10 states. [2019-11-28 02:47:41,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:41,430 INFO L93 Difference]: Finished difference Result 149 states and 160 transitions. [2019-11-28 02:47:41,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 02:47:41,431 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-28 02:47:41,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:41,432 INFO L225 Difference]: With dead ends: 149 [2019-11-28 02:47:41,432 INFO L226 Difference]: Without dead ends: 149 [2019-11-28 02:47:41,433 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-11-28 02:47:41,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-28 02:47:41,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 101. [2019-11-28 02:47:41,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-28 02:47:41,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2019-11-28 02:47:41,437 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 20 [2019-11-28 02:47:41,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:41,437 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2019-11-28 02:47:41,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 02:47:41,438 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2019-11-28 02:47:41,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 02:47:41,438 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:41,439 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] [2019-11-28 02:47:41,439 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 02:47:41,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:41,440 INFO L82 PathProgramCache]: Analyzing trace with hash 975241551, now seen corresponding path program 1 times [2019-11-28 02:47:41,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:41,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244896769] [2019-11-28 02:47:41,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:41,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:41,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:41,597 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:47:41,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244896769] [2019-11-28 02:47:41,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:41,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 02:47:41,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157512831] [2019-11-28 02:47:41,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 02:47:41,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:41,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 02:47:41,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:47:41,599 INFO L87 Difference]: Start difference. First operand 101 states and 114 transitions. Second operand 9 states. [2019-11-28 02:47:42,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:42,063 INFO L93 Difference]: Finished difference Result 159 states and 170 transitions. [2019-11-28 02:47:42,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 02:47:42,064 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-11-28 02:47:42,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:42,066 INFO L225 Difference]: With dead ends: 159 [2019-11-28 02:47:42,066 INFO L226 Difference]: Without dead ends: 159 [2019-11-28 02:47:42,066 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-11-28 02:47:42,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-28 02:47:42,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 101. [2019-11-28 02:47:42,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-28 02:47:42,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2019-11-28 02:47:42,072 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 20 [2019-11-28 02:47:42,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:42,072 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2019-11-28 02:47:42,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 02:47:42,072 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2019-11-28 02:47:42,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 02:47:42,073 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:42,073 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:47:42,074 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 02:47:42,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:42,074 INFO L82 PathProgramCache]: Analyzing trace with hash 167702177, now seen corresponding path program 1 times [2019-11-28 02:47:42,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:42,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321129047] [2019-11-28 02:47:42,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:42,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:42,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:42,168 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:47:42,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321129047] [2019-11-28 02:47:42,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:42,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 02:47:42,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931727628] [2019-11-28 02:47:42,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 02:47:42,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:42,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 02:47:42,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:47:42,170 INFO L87 Difference]: Start difference. First operand 101 states and 113 transitions. Second operand 8 states. [2019-11-28 02:47:42,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:42,578 INFO L93 Difference]: Finished difference Result 138 states and 153 transitions. [2019-11-28 02:47:42,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 02:47:42,579 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-11-28 02:47:42,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:42,581 INFO L225 Difference]: With dead ends: 138 [2019-11-28 02:47:42,581 INFO L226 Difference]: Without dead ends: 138 [2019-11-28 02:47:42,581 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-11-28 02:47:42,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-11-28 02:47:42,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 102. [2019-11-28 02:47:42,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-28 02:47:42,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2019-11-28 02:47:42,586 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 21 [2019-11-28 02:47:42,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:42,586 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 115 transitions. [2019-11-28 02:47:42,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 02:47:42,586 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2019-11-28 02:47:42,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 02:47:42,587 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:42,588 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:47:42,588 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 02:47:42,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:42,588 INFO L82 PathProgramCache]: Analyzing trace with hash 167702178, now seen corresponding path program 1 times [2019-11-28 02:47:42,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:42,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62674292] [2019-11-28 02:47:42,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:42,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:42,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:42,777 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:47:42,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62674292] [2019-11-28 02:47:42,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:42,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-28 02:47:42,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855685602] [2019-11-28 02:47:42,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 02:47:42,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:42,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 02:47:42,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:47:42,780 INFO L87 Difference]: Start difference. First operand 102 states and 115 transitions. Second operand 12 states. [2019-11-28 02:47:43,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:43,597 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2019-11-28 02:47:43,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 02:47:43,597 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-11-28 02:47:43,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:43,599 INFO L225 Difference]: With dead ends: 149 [2019-11-28 02:47:43,599 INFO L226 Difference]: Without dead ends: 149 [2019-11-28 02:47:43,599 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2019-11-28 02:47:43,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-28 02:47:43,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 121. [2019-11-28 02:47:43,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-28 02:47:43,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 148 transitions. [2019-11-28 02:47:43,605 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 148 transitions. Word has length 21 [2019-11-28 02:47:43,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:43,605 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 148 transitions. [2019-11-28 02:47:43,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 02:47:43,606 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 148 transitions. [2019-11-28 02:47:43,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 02:47:43,607 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:43,607 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, 1] [2019-11-28 02:47:43,607 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 02:47:43,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:43,608 INFO L82 PathProgramCache]: Analyzing trace with hash -2046960464, now seen corresponding path program 1 times [2019-11-28 02:47:43,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:43,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788553829] [2019-11-28 02:47:43,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:43,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:43,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:43,996 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:47:43,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788553829] [2019-11-28 02:47:43,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:43,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-28 02:47:43,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628733267] [2019-11-28 02:47:43,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 02:47:43,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:43,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 02:47:43,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-11-28 02:47:43,998 INFO L87 Difference]: Start difference. First operand 121 states and 148 transitions. Second operand 13 states. [2019-11-28 02:47:44,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:44,708 INFO L93 Difference]: Finished difference Result 162 states and 173 transitions. [2019-11-28 02:47:44,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 02:47:44,709 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-11-28 02:47:44,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:44,710 INFO L225 Difference]: With dead ends: 162 [2019-11-28 02:47:44,710 INFO L226 Difference]: Without dead ends: 162 [2019-11-28 02:47:44,711 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2019-11-28 02:47:44,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-11-28 02:47:44,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 122. [2019-11-28 02:47:44,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-28 02:47:44,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 149 transitions. [2019-11-28 02:47:44,715 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 149 transitions. Word has length 23 [2019-11-28 02:47:44,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:44,716 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 149 transitions. [2019-11-28 02:47:44,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 02:47:44,716 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 149 transitions. [2019-11-28 02:47:44,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 02:47:44,718 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:44,719 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, 1] [2019-11-28 02:47:44,719 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 02:47:44,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:44,720 INFO L82 PathProgramCache]: Analyzing trace with hash -280035452, now seen corresponding path program 1 times [2019-11-28 02:47:44,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:44,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293150055] [2019-11-28 02:47:44,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:44,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:44,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:44,824 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:47:44,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293150055] [2019-11-28 02:47:44,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:44,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 02:47:44,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710174975] [2019-11-28 02:47:44,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 02:47:44,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:44,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 02:47:44,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:47:44,827 INFO L87 Difference]: Start difference. First operand 122 states and 149 transitions. Second operand 8 states. [2019-11-28 02:47:45,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:45,175 INFO L93 Difference]: Finished difference Result 152 states and 168 transitions. [2019-11-28 02:47:45,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 02:47:45,175 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-11-28 02:47:45,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:45,177 INFO L225 Difference]: With dead ends: 152 [2019-11-28 02:47:45,177 INFO L226 Difference]: Without dead ends: 152 [2019-11-28 02:47:45,178 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-11-28 02:47:45,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-28 02:47:45,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 120. [2019-11-28 02:47:45,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-28 02:47:45,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 147 transitions. [2019-11-28 02:47:45,182 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 147 transitions. Word has length 23 [2019-11-28 02:47:45,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:45,182 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 147 transitions. [2019-11-28 02:47:45,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 02:47:45,182 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 147 transitions. [2019-11-28 02:47:45,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 02:47:45,183 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:45,183 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, 1, 1] [2019-11-28 02:47:45,184 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 02:47:45,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:45,184 INFO L82 PathProgramCache]: Analyzing trace with hash 968735281, now seen corresponding path program 1 times [2019-11-28 02:47:45,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:45,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619108753] [2019-11-28 02:47:45,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:45,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:45,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:45,300 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:47:45,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619108753] [2019-11-28 02:47:45,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:45,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 02:47:45,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876479330] [2019-11-28 02:47:45,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 02:47:45,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:45,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 02:47:45,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:47:45,303 INFO L87 Difference]: Start difference. First operand 120 states and 147 transitions. Second operand 9 states. [2019-11-28 02:47:45,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:45,701 INFO L93 Difference]: Finished difference Result 152 states and 166 transitions. [2019-11-28 02:47:45,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 02:47:45,702 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2019-11-28 02:47:45,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:45,703 INFO L225 Difference]: With dead ends: 152 [2019-11-28 02:47:45,703 INFO L226 Difference]: Without dead ends: 152 [2019-11-28 02:47:45,704 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-11-28 02:47:45,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-28 02:47:45,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 121. [2019-11-28 02:47:45,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-28 02:47:45,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 148 transitions. [2019-11-28 02:47:45,708 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 148 transitions. Word has length 24 [2019-11-28 02:47:45,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:45,708 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 148 transitions. [2019-11-28 02:47:45,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 02:47:45,709 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 148 transitions. [2019-11-28 02:47:45,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 02:47:45,713 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:45,713 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, 1, 1] [2019-11-28 02:47:45,715 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 02:47:45,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:45,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1412435069, now seen corresponding path program 1 times [2019-11-28 02:47:45,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:45,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084667714] [2019-11-28 02:47:45,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:45,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:45,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:45,993 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:47:45,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084667714] [2019-11-28 02:47:45,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:45,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-28 02:47:45,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946897072] [2019-11-28 02:47:45,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 02:47:45,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:45,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 02:47:45,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-11-28 02:47:45,996 INFO L87 Difference]: Start difference. First operand 121 states and 148 transitions. Second operand 13 states. [2019-11-28 02:47:46,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:46,605 INFO L93 Difference]: Finished difference Result 144 states and 155 transitions. [2019-11-28 02:47:46,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 02:47:46,605 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2019-11-28 02:47:46,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:46,607 INFO L225 Difference]: With dead ends: 144 [2019-11-28 02:47:46,607 INFO L226 Difference]: Without dead ends: 144 [2019-11-28 02:47:46,608 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2019-11-28 02:47:46,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-28 02:47:46,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 121. [2019-11-28 02:47:46,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-28 02:47:46,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 147 transitions. [2019-11-28 02:47:46,612 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 147 transitions. Word has length 24 [2019-11-28 02:47:46,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:46,613 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 147 transitions. [2019-11-28 02:47:46,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 02:47:46,613 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 147 transitions. [2019-11-28 02:47:46,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 02:47:46,614 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:46,614 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, 1, 1, 1] [2019-11-28 02:47:46,614 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 02:47:46,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:46,615 INFO L82 PathProgramCache]: Analyzing trace with hash -33931422, now seen corresponding path program 1 times [2019-11-28 02:47:46,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:46,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993153631] [2019-11-28 02:47:46,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:46,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:46,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:46,725 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:47:46,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993153631] [2019-11-28 02:47:46,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:46,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 02:47:46,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103653569] [2019-11-28 02:47:46,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 02:47:46,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:46,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 02:47:46,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:47:46,728 INFO L87 Difference]: Start difference. First operand 121 states and 147 transitions. Second operand 9 states. [2019-11-28 02:47:47,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:47,147 INFO L93 Difference]: Finished difference Result 144 states and 158 transitions. [2019-11-28 02:47:47,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 02:47:47,148 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-11-28 02:47:47,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:47,150 INFO L225 Difference]: With dead ends: 144 [2019-11-28 02:47:47,150 INFO L226 Difference]: Without dead ends: 144 [2019-11-28 02:47:47,151 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-11-28 02:47:47,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-28 02:47:47,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 123. [2019-11-28 02:47:47,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-11-28 02:47:47,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 149 transitions. [2019-11-28 02:47:47,157 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 149 transitions. Word has length 25 [2019-11-28 02:47:47,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:47,157 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 149 transitions. [2019-11-28 02:47:47,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 02:47:47,158 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 149 transitions. [2019-11-28 02:47:47,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 02:47:47,159 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:47,159 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, 1, 1, 1] [2019-11-28 02:47:47,160 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 02:47:47,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:47,160 INFO L82 PathProgramCache]: Analyzing trace with hash 835442004, now seen corresponding path program 1 times [2019-11-28 02:47:47,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:47,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335805695] [2019-11-28 02:47:47,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:47,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:47,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:47,212 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:47:47,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335805695] [2019-11-28 02:47:47,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:47,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 02:47:47,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780750331] [2019-11-28 02:47:47,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:47:47,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:47,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:47:47,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:47:47,215 INFO L87 Difference]: Start difference. First operand 123 states and 149 transitions. Second operand 6 states. [2019-11-28 02:47:47,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:47,416 INFO L93 Difference]: Finished difference Result 124 states and 150 transitions. [2019-11-28 02:47:47,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:47:47,417 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-11-28 02:47:47,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:47,420 INFO L225 Difference]: With dead ends: 124 [2019-11-28 02:47:47,420 INFO L226 Difference]: Without dead ends: 124 [2019-11-28 02:47:47,421 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:47:47,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-11-28 02:47:47,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2019-11-28 02:47:47,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-28 02:47:47,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 146 transitions. [2019-11-28 02:47:47,428 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 146 transitions. Word has length 25 [2019-11-28 02:47:47,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:47,429 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 146 transitions. [2019-11-28 02:47:47,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:47:47,429 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 146 transitions. [2019-11-28 02:47:47,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 02:47:47,430 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:47,431 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, 1, 1, 1] [2019-11-28 02:47:47,431 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 02:47:47,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:47,431 INFO L82 PathProgramCache]: Analyzing trace with hash 835442005, now seen corresponding path program 1 times [2019-11-28 02:47:47,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:47,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510441688] [2019-11-28 02:47:47,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:47,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:47,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:47,608 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:47:47,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510441688] [2019-11-28 02:47:47,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:47,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-28 02:47:47,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659591577] [2019-11-28 02:47:47,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 02:47:47,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:47,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 02:47:47,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-28 02:47:47,611 INFO L87 Difference]: Start difference. First operand 122 states and 146 transitions. Second operand 11 states. [2019-11-28 02:47:48,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:48,161 INFO L93 Difference]: Finished difference Result 142 states and 153 transitions. [2019-11-28 02:47:48,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 02:47:48,164 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-11-28 02:47:48,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:48,165 INFO L225 Difference]: With dead ends: 142 [2019-11-28 02:47:48,166 INFO L226 Difference]: Without dead ends: 142 [2019-11-28 02:47:48,166 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-11-28 02:47:48,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-28 02:47:48,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 122. [2019-11-28 02:47:48,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-28 02:47:48,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 145 transitions. [2019-11-28 02:47:48,170 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 145 transitions. Word has length 25 [2019-11-28 02:47:48,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:48,171 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 145 transitions. [2019-11-28 02:47:48,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 02:47:48,171 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 145 transitions. [2019-11-28 02:47:48,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 02:47:48,172 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:48,172 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, 1, 1, 1, 1] [2019-11-28 02:47:48,172 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 02:47:48,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:48,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1053290924, now seen corresponding path program 1 times [2019-11-28 02:47:48,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:48,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595513069] [2019-11-28 02:47:48,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:48,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:48,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:48,384 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:47:48,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595513069] [2019-11-28 02:47:48,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:48,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-28 02:47:48,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49490908] [2019-11-28 02:47:48,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 02:47:48,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:48,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 02:47:48,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:47:48,386 INFO L87 Difference]: Start difference. First operand 122 states and 145 transitions. Second operand 10 states. [2019-11-28 02:47:48,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:48,850 INFO L93 Difference]: Finished difference Result 140 states and 150 transitions. [2019-11-28 02:47:48,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 02:47:48,851 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-11-28 02:47:48,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:48,852 INFO L225 Difference]: With dead ends: 140 [2019-11-28 02:47:48,852 INFO L226 Difference]: Without dead ends: 140 [2019-11-28 02:47:48,852 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-11-28 02:47:48,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-11-28 02:47:48,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 122. [2019-11-28 02:47:48,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-28 02:47:48,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 144 transitions. [2019-11-28 02:47:48,859 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 144 transitions. Word has length 26 [2019-11-28 02:47:48,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:48,860 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 144 transitions. [2019-11-28 02:47:48,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 02:47:48,860 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 144 transitions. [2019-11-28 02:47:48,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 02:47:48,861 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:48,861 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, 1, 1, 1, 1, 1] [2019-11-28 02:47:48,861 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 02:47:48,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:48,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1012463367, now seen corresponding path program 1 times [2019-11-28 02:47:48,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:48,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921412497] [2019-11-28 02:47:48,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:48,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:48,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:48,901 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:47:48,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921412497] [2019-11-28 02:47:48,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:48,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 02:47:48,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159106038] [2019-11-28 02:47:48,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:47:48,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:48,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:47:48,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:47:48,906 INFO L87 Difference]: Start difference. First operand 122 states and 144 transitions. Second operand 4 states. [2019-11-28 02:47:49,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:49,054 INFO L93 Difference]: Finished difference Result 191 states and 218 transitions. [2019-11-28 02:47:49,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:47:49,055 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-11-28 02:47:49,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:49,057 INFO L225 Difference]: With dead ends: 191 [2019-11-28 02:47:49,057 INFO L226 Difference]: Without dead ends: 191 [2019-11-28 02:47:49,058 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:47:49,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-11-28 02:47:49,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 137. [2019-11-28 02:47:49,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-11-28 02:47:49,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 161 transitions. [2019-11-28 02:47:49,066 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 161 transitions. Word has length 27 [2019-11-28 02:47:49,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:49,067 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 161 transitions. [2019-11-28 02:47:49,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:47:49,067 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 161 transitions. [2019-11-28 02:47:49,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 02:47:49,069 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:49,069 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, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:49,071 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 02:47:49,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:49,071 INFO L82 PathProgramCache]: Analyzing trace with hash -682632713, now seen corresponding path program 1 times [2019-11-28 02:47:49,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:49,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250368153] [2019-11-28 02:47:49,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:49,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:47:49,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:47:49,153 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:47:49,154 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 02:47:49,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:47:49 BoogieIcfgContainer [2019-11-28 02:47:49,241 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 02:47:49,242 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 02:47:49,242 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 02:47:49,243 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 02:47:49,244 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:47:33" (3/4) ... [2019-11-28 02:47:49,254 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 02:47:49,330 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 02:47:49,330 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 02:47:49,333 INFO L168 Benchmark]: Toolchain (without parser) took 16934.81 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 354.4 MB). Free memory was 952.3 MB in the beginning and 1.0 GB in the end (delta: -92.3 MB). Peak memory consumption was 262.1 MB. Max. memory is 11.5 GB. [2019-11-28 02:47:49,336 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:47:49,336 INFO L168 Benchmark]: CACSL2BoogieTranslator took 632.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -170.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-11-28 02:47:49,337 INFO L168 Benchmark]: Boogie Preprocessor took 74.28 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: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. [2019-11-28 02:47:49,337 INFO L168 Benchmark]: RCFGBuilder took 799.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.0 MB). Peak memory consumption was 58.0 MB. Max. memory is 11.5 GB. [2019-11-28 02:47:49,338 INFO L168 Benchmark]: TraceAbstraction took 15334.61 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 215.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 11.3 MB). Peak memory consumption was 226.3 MB. Max. memory is 11.5 GB. [2019-11-28 02:47:49,338 INFO L168 Benchmark]: Witness Printer took 88.48 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:47:49,345 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.33 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 632.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -170.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 74.28 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: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 799.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.0 MB). Peak memory consumption was 58.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15334.61 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 215.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 11.3 MB). Peak memory consumption was 226.3 MB. Max. memory is 11.5 GB. * Witness Printer took 88.48 ms. Allocated memory is still 1.4 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.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1023]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L986] SLL* head = malloc(sizeof(SLL)); VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}] [L987] head->next = head VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}] [L988] head->data = 0 VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}] [L990] SLL* x = head; [L991] int state = 1; VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}] [L994] COND FALSE !(__VERIFIER_nondet_int()) [L1016] x->data = state VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}] [L1018] EXPR head->next VAL [head={-1:0}, head->next={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}] [L1018] x = head->next [L1019] COND FALSE !(!(((void*)0) != x)) VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}] [L1021] EXPR x->data VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}, x->data=1] [L1021] COND TRUE x->data != 0 [L1023] EXPR x->next VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}, x->next={-1:0}] [L1023] EXPR x->next->data VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}, x->next={-1:0}, x->next->data=1] [L1023] EXPR x->next->data != 0 && x->data > x->next->data VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data != 0 && x->data > x->next->data=1] [L1023] EXPR x->data VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next->data=1, x->next->data != 0 && x->data > x->next->data=1] [L1023] EXPR x->next VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data != 0 && x->data > x->next->data=1] [L1023] EXPR x->next->data VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data=1, x->next->data != 0 && x->data > x->next->data=1] [L1023] EXPR x->next->data != 0 && x->data > x->next->data VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data=1, x->next->data != 0 && x->data > x->next->data=0] [L1023] COND TRUE !(x->next->data != 0 && x->data > x->next->data) [L1023] __VERIFIER_error() VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 113 locations, 50 error locations. Result: UNSAFE, OverallTime: 15.1s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 11.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1602 SDtfs, 4376 SDslu, 4798 SDs, 0 SdLazy, 7438 SolverSat, 374 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 343 GetRequests, 73 SyntacticMatches, 6 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 766 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 484 NumberOfCodeBlocks, 484 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 432 ConstructedInterpolants, 0 QuantifiedInterpolants, 73116 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...