./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/forester-heap/sll-circular-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/sll-circular-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b651d63eb42259dfd3a213a6671e4c58ee528ad0 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:50,189 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 02:47:50,192 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 02:47:50,207 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 02:47:50,208 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 02:47:50,209 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 02:47:50,211 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 02:47:50,213 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 02:47:50,215 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 02:47:50,215 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 02:47:50,217 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 02:47:50,218 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 02:47:50,218 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 02:47:50,219 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 02:47:50,220 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 02:47:50,222 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 02:47:50,222 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 02:47:50,224 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 02:47:50,225 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 02:47:50,228 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 02:47:50,229 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 02:47:50,231 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 02:47:50,232 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 02:47:50,233 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 02:47:50,235 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 02:47:50,236 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 02:47:50,236 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 02:47:50,237 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 02:47:50,238 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 02:47:50,239 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 02:47:50,239 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 02:47:50,240 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 02:47:50,241 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 02:47:50,242 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 02:47:50,243 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 02:47:50,243 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 02:47:50,244 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 02:47:50,244 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 02:47:50,244 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 02:47:50,245 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 02:47:50,246 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 02:47:50,247 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:50,265 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 02:47:50,265 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 02:47:50,266 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 02:47:50,267 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 02:47:50,267 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 02:47:50,267 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 02:47:50,268 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 02:47:50,268 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 02:47:50,268 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 02:47:50,269 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 02:47:50,269 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 02:47:50,269 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 02:47:50,269 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 02:47:50,270 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 02:47:50,270 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 02:47:50,270 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 02:47:50,270 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 02:47:50,271 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 02:47:50,271 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 02:47:50,271 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 02:47:50,272 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 02:47:50,272 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:47:50,272 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 02:47:50,272 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 02:47:50,273 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 02:47:50,273 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 02:47:50,273 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 -> b651d63eb42259dfd3a213a6671e4c58ee528ad0 [2019-11-28 02:47:50,609 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 02:47:50,623 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 02:47:50,626 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 02:47:50,628 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 02:47:50,628 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 02:47:50,629 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-circular-2.i [2019-11-28 02:47:50,691 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23074e486/f1bcfea5f75941b3851173d5d1e8fbe5/FLAG125b343e6 [2019-11-28 02:47:51,238 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 02:47:51,240 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-2.i [2019-11-28 02:47:51,262 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23074e486/f1bcfea5f75941b3851173d5d1e8fbe5/FLAG125b343e6 [2019-11-28 02:47:51,533 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23074e486/f1bcfea5f75941b3851173d5d1e8fbe5 [2019-11-28 02:47:51,537 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 02:47:51,540 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 02:47:51,541 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 02:47:51,542 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 02:47:51,545 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 02:47:51,546 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:47:51" (1/1) ... [2019-11-28 02:47:51,549 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@564c4a0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:51, skipping insertion in model container [2019-11-28 02:47:51,549 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:47:51" (1/1) ... [2019-11-28 02:47:51,556 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 02:47:51,602 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 02:47:52,029 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:47:52,040 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 02:47:52,083 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:47:52,138 INFO L208 MainTranslator]: Completed translation [2019-11-28 02:47:52,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:52 WrapperNode [2019-11-28 02:47:52,139 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 02:47:52,140 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 02:47:52,141 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 02:47:52,141 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 02:47:52,153 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:52" (1/1) ... [2019-11-28 02:47:52,153 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:52" (1/1) ... [2019-11-28 02:47:52,170 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:52" (1/1) ... [2019-11-28 02:47:52,171 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:52" (1/1) ... [2019-11-28 02:47:52,189 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:52" (1/1) ... [2019-11-28 02:47:52,196 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:52" (1/1) ... [2019-11-28 02:47:52,200 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:52" (1/1) ... [2019-11-28 02:47:52,207 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 02:47:52,208 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 02:47:52,208 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 02:47:52,208 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 02:47:52,209 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:52" (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:52,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 02:47:52,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 02:47:52,267 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 02:47:52,267 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-28 02:47:52,267 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-28 02:47:52,268 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-28 02:47:52,268 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-28 02:47:52,268 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-28 02:47:52,268 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-28 02:47:52,269 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-28 02:47:52,269 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-28 02:47:52,269 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-28 02:47:52,269 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-28 02:47:52,269 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-28 02:47:52,270 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-28 02:47:52,270 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-28 02:47:52,270 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-28 02:47:52,270 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-28 02:47:52,271 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-28 02:47:52,271 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-28 02:47:52,271 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-28 02:47:52,271 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-28 02:47:52,272 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-28 02:47:52,272 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-28 02:47:52,272 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-28 02:47:52,272 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-28 02:47:52,273 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-28 02:47:52,273 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-28 02:47:52,273 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-28 02:47:52,273 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-28 02:47:52,273 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-28 02:47:52,274 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-28 02:47:52,274 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-28 02:47:52,274 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-28 02:47:52,274 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-28 02:47:52,274 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-28 02:47:52,275 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-28 02:47:52,275 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-28 02:47:52,275 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-28 02:47:52,275 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-28 02:47:52,275 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-28 02:47:52,276 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-28 02:47:52,276 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-28 02:47:52,276 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-28 02:47:52,276 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-28 02:47:52,277 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-28 02:47:52,277 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-28 02:47:52,277 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-28 02:47:52,277 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-28 02:47:52,278 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-28 02:47:52,278 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-28 02:47:52,278 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-28 02:47:52,278 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-28 02:47:52,278 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-28 02:47:52,279 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-28 02:47:52,279 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-28 02:47:52,279 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-28 02:47:52,279 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-28 02:47:52,280 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-28 02:47:52,280 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-28 02:47:52,280 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-28 02:47:52,280 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-28 02:47:52,280 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-28 02:47:52,281 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-28 02:47:52,281 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-28 02:47:52,281 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-28 02:47:52,281 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-28 02:47:52,282 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-28 02:47:52,282 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-28 02:47:52,282 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-28 02:47:52,282 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-28 02:47:52,282 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-28 02:47:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-28 02:47:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-28 02:47:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-28 02:47:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-28 02:47:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-28 02:47:52,284 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-28 02:47:52,284 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-28 02:47:52,284 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-28 02:47:52,284 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-28 02:47:52,285 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-28 02:47:52,285 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-28 02:47:52,285 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-28 02:47:52,285 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-28 02:47:52,285 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-28 02:47:52,286 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-28 02:47:52,286 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-28 02:47:52,286 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-28 02:47:52,286 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-28 02:47:52,286 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-28 02:47:52,287 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-28 02:47:52,287 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-28 02:47:52,287 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-28 02:47:52,287 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-28 02:47:52,288 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-28 02:47:52,288 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-28 02:47:52,288 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-28 02:47:52,288 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-28 02:47:52,288 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-28 02:47:52,289 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-28 02:47:52,289 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-28 02:47:52,289 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-28 02:47:52,289 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-28 02:47:52,289 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-28 02:47:52,290 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-28 02:47:52,290 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-28 02:47:52,290 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-28 02:47:52,290 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 02:47:52,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 02:47:52,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 02:47:52,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 02:47:52,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 02:47:52,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 02:47:52,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 02:47:52,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 02:47:52,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 02:47:52,911 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 02:47:52,912 INFO L297 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-28 02:47:52,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:47:52 BoogieIcfgContainer [2019-11-28 02:47:52,914 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 02:47:52,916 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 02:47:52,916 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 02:47:52,921 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 02:47:52,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:47:51" (1/3) ... [2019-11-28 02:47:52,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@389d0093 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:47:52, skipping insertion in model container [2019-11-28 02:47:52,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:52" (2/3) ... [2019-11-28 02:47:52,924 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@389d0093 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:47:52, skipping insertion in model container [2019-11-28 02:47:52,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:47:52" (3/3) ... [2019-11-28 02:47:52,927 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-circular-2.i [2019-11-28 02:47:52,937 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 02:47:52,958 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 46 error locations. [2019-11-28 02:47:52,973 INFO L249 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2019-11-28 02:47:52,996 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 02:47:53,000 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 02:47:53,001 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 02:47:53,001 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 02:47:53,002 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 02:47:53,002 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 02:47:53,002 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 02:47:53,002 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 02:47:53,034 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states. [2019-11-28 02:47:53,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-28 02:47:53,048 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:53,049 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:53,050 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr45ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 02:47:53,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:53,069 INFO L82 PathProgramCache]: Analyzing trace with hash -393144633, now seen corresponding path program 1 times [2019-11-28 02:47:53,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:53,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410807769] [2019-11-28 02:47:53,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:53,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:53,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:53,263 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:53,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410807769] [2019-11-28 02:47:53,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:53,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:47:53,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085351537] [2019-11-28 02:47:53,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:47:53,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:53,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:47:53,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:47:53,294 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 4 states. [2019-11-28 02:47:53,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:53,653 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2019-11-28 02:47:53,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:47:53,655 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-28 02:47:53,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:53,667 INFO L225 Difference]: With dead ends: 112 [2019-11-28 02:47:53,667 INFO L226 Difference]: Without dead ends: 109 [2019-11-28 02:47:53,669 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:53,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-28 02:47:53,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 99. [2019-11-28 02:47:53,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-28 02:47:53,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2019-11-28 02:47:53,729 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 7 [2019-11-28 02:47:53,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:53,729 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2019-11-28 02:47:53,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:47:53,730 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2019-11-28 02:47:53,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-28 02:47:53,730 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:53,731 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:53,731 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr45ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 02:47:53,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:53,732 INFO L82 PathProgramCache]: Analyzing trace with hash -393144632, now seen corresponding path program 1 times [2019-11-28 02:47:53,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:53,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239860229] [2019-11-28 02:47:53,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:53,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:53,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:53,826 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:53,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239860229] [2019-11-28 02:47:53,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:53,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:47:53,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854055186] [2019-11-28 02:47:53,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:47:53,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:53,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:47:53,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:47:53,834 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand 4 states. [2019-11-28 02:47:54,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:54,102 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2019-11-28 02:47:54,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:47:54,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-28 02:47:54,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:54,106 INFO L225 Difference]: With dead ends: 107 [2019-11-28 02:47:54,106 INFO L226 Difference]: Without dead ends: 107 [2019-11-28 02:47:54,108 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:54,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-28 02:47:54,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 95. [2019-11-28 02:47:54,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-11-28 02:47:54,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2019-11-28 02:47:54,132 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 7 [2019-11-28 02:47:54,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:54,134 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2019-11-28 02:47:54,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:47:54,135 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2019-11-28 02:47:54,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 02:47:54,136 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:54,136 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:54,137 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr45ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 02:47:54,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:54,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1494937539, now seen corresponding path program 1 times [2019-11-28 02:47:54,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:54,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698710884] [2019-11-28 02:47:54,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:54,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:54,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:54,278 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:54,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698710884] [2019-11-28 02:47:54,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:54,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 02:47:54,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494158770] [2019-11-28 02:47:54,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:47:54,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:54,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:47:54,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:47:54,283 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand 5 states. [2019-11-28 02:47:54,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:54,560 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2019-11-28 02:47:54,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:47:54,561 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-28 02:47:54,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:54,563 INFO L225 Difference]: With dead ends: 93 [2019-11-28 02:47:54,563 INFO L226 Difference]: Without dead ends: 93 [2019-11-28 02:47:54,564 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:54,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-28 02:47:54,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 84. [2019-11-28 02:47:54,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-28 02:47:54,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2019-11-28 02:47:54,581 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 12 [2019-11-28 02:47:54,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:54,582 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2019-11-28 02:47:54,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:47:54,582 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2019-11-28 02:47:54,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 02:47:54,583 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:54,583 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:54,584 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr45ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 02:47:54,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:54,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1494937538, now seen corresponding path program 1 times [2019-11-28 02:47:54,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:54,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030001562] [2019-11-28 02:47:54,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:54,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:54,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:54,693 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:54,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030001562] [2019-11-28 02:47:54,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:54,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 02:47:54,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616063689] [2019-11-28 02:47:54,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:47:54,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:54,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:47:54,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:47:54,696 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand 5 states. [2019-11-28 02:47:54,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:54,951 INFO L93 Difference]: Finished difference Result 103 states and 110 transitions. [2019-11-28 02:47:54,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:47:54,952 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-28 02:47:54,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:54,953 INFO L225 Difference]: With dead ends: 103 [2019-11-28 02:47:54,953 INFO L226 Difference]: Without dead ends: 103 [2019-11-28 02:47:54,953 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:47:54,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-28 02:47:54,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 89. [2019-11-28 02:47:54,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-28 02:47:54,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2019-11-28 02:47:54,961 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 12 [2019-11-28 02:47:54,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:54,962 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2019-11-28 02:47:54,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:47:54,962 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2019-11-28 02:47:54,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 02:47:54,963 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:54,963 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:54,963 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr45ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 02:47:54,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:54,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1168041069, now seen corresponding path program 1 times [2019-11-28 02:47:54,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:54,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361178653] [2019-11-28 02:47:54,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:54,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:55,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:55,074 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:55,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361178653] [2019-11-28 02:47:55,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:55,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 02:47:55,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333157238] [2019-11-28 02:47:55,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:47:55,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:55,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:47:55,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:47:55,079 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 7 states. [2019-11-28 02:47:55,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:55,510 INFO L93 Difference]: Finished difference Result 139 states and 149 transitions. [2019-11-28 02:47:55,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 02:47:55,511 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-11-28 02:47:55,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:55,513 INFO L225 Difference]: With dead ends: 139 [2019-11-28 02:47:55,513 INFO L226 Difference]: Without dead ends: 139 [2019-11-28 02:47:55,514 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:47:55,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-11-28 02:47:55,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 88. [2019-11-28 02:47:55,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-28 02:47:55,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2019-11-28 02:47:55,523 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 15 [2019-11-28 02:47:55,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:55,523 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2019-11-28 02:47:55,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:47:55,524 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2019-11-28 02:47:55,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 02:47:55,525 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:55,525 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:55,526 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr45ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 02:47:55,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:55,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1168041068, now seen corresponding path program 1 times [2019-11-28 02:47:55,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:55,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398541316] [2019-11-28 02:47:55,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:55,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:55,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:55,623 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:55,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398541316] [2019-11-28 02:47:55,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:55,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 02:47:55,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367884839] [2019-11-28 02:47:55,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:47:55,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:55,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:47:55,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:47:55,625 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 7 states. [2019-11-28 02:47:56,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:56,168 INFO L93 Difference]: Finished difference Result 137 states and 146 transitions. [2019-11-28 02:47:56,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 02:47:56,169 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-11-28 02:47:56,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:56,170 INFO L225 Difference]: With dead ends: 137 [2019-11-28 02:47:56,170 INFO L226 Difference]: Without dead ends: 137 [2019-11-28 02:47:56,171 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:47:56,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-11-28 02:47:56,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 78. [2019-11-28 02:47:56,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-28 02:47:56,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2019-11-28 02:47:56,177 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 15 [2019-11-28 02:47:56,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:56,177 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2019-11-28 02:47:56,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:47:56,177 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2019-11-28 02:47:56,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 02:47:56,178 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:56,178 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:56,178 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr45ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 02:47:56,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:56,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1857169056, now seen corresponding path program 1 times [2019-11-28 02:47:56,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:56,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376707629] [2019-11-28 02:47:56,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:56,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:56,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:56,357 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:56,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376707629] [2019-11-28 02:47:56,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:56,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 02:47:56,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727251834] [2019-11-28 02:47:56,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 02:47:56,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:56,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 02:47:56,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:47:56,359 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand 9 states. [2019-11-28 02:47:56,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:56,732 INFO L93 Difference]: Finished difference Result 166 states and 177 transitions. [2019-11-28 02:47:56,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 02:47:56,733 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-11-28 02:47:56,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:56,734 INFO L225 Difference]: With dead ends: 166 [2019-11-28 02:47:56,735 INFO L226 Difference]: Without dead ends: 166 [2019-11-28 02:47:56,735 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-11-28 02:47:56,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-11-28 02:47:56,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 84. [2019-11-28 02:47:56,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-28 02:47:56,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2019-11-28 02:47:56,741 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 16 [2019-11-28 02:47:56,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:56,741 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2019-11-28 02:47:56,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 02:47:56,742 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2019-11-28 02:47:56,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 02:47:56,742 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:56,742 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:56,743 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr45ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 02:47:56,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:56,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1737661726, now seen corresponding path program 1 times [2019-11-28 02:47:56,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:56,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456450869] [2019-11-28 02:47:56,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:56,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:56,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:56,897 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:56,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456450869] [2019-11-28 02:47:56,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:56,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 02:47:56,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761996845] [2019-11-28 02:47:56,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 02:47:56,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:56,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 02:47:56,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:47:56,901 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand 9 states. [2019-11-28 02:47:57,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:57,300 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2019-11-28 02:47:57,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 02:47:57,301 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2019-11-28 02:47:57,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:57,302 INFO L225 Difference]: With dead ends: 127 [2019-11-28 02:47:57,302 INFO L226 Difference]: Without dead ends: 127 [2019-11-28 02:47:57,302 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:57,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-28 02:47:57,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 86. [2019-11-28 02:47:57,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-28 02:47:57,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2019-11-28 02:47:57,307 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 17 [2019-11-28 02:47:57,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:57,307 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2019-11-28 02:47:57,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 02:47:57,308 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2019-11-28 02:47:57,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 02:47:57,308 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:57,308 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:57,309 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr45ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 02:47:57,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:57,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1737661725, now seen corresponding path program 1 times [2019-11-28 02:47:57,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:57,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846990839] [2019-11-28 02:47:57,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:57,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:57,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:57,538 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:57,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846990839] [2019-11-28 02:47:57,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:57,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 02:47:57,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103130819] [2019-11-28 02:47:57,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 02:47:57,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:57,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 02:47:57,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:47:57,546 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand 9 states. [2019-11-28 02:47:57,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:57,984 INFO L93 Difference]: Finished difference Result 160 states and 171 transitions. [2019-11-28 02:47:57,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 02:47:57,985 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2019-11-28 02:47:57,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:57,986 INFO L225 Difference]: With dead ends: 160 [2019-11-28 02:47:57,987 INFO L226 Difference]: Without dead ends: 160 [2019-11-28 02:47:57,987 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-11-28 02:47:57,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-28 02:47:57,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 98. [2019-11-28 02:47:57,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-28 02:47:57,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 112 transitions. [2019-11-28 02:47:57,992 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 112 transitions. Word has length 17 [2019-11-28 02:47:57,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:57,992 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 112 transitions. [2019-11-28 02:47:57,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 02:47:57,992 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2019-11-28 02:47:57,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 02:47:57,993 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:57,993 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:57,994 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr45ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 02:47:57,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:57,994 INFO L82 PathProgramCache]: Analyzing trace with hash 560416014, now seen corresponding path program 1 times [2019-11-28 02:47:57,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:57,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003595977] [2019-11-28 02:47:57,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:58,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:58,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:58,145 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:58,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003595977] [2019-11-28 02:47:58,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:58,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 02:47:58,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029550906] [2019-11-28 02:47:58,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 02:47:58,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:58,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 02:47:58,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:47:58,147 INFO L87 Difference]: Start difference. First operand 98 states and 112 transitions. Second operand 10 states. [2019-11-28 02:47:58,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:58,724 INFO L93 Difference]: Finished difference Result 146 states and 157 transitions. [2019-11-28 02:47:58,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 02:47:58,724 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-28 02:47:58,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:58,726 INFO L225 Difference]: With dead ends: 146 [2019-11-28 02:47:58,726 INFO L226 Difference]: Without dead ends: 146 [2019-11-28 02:47:58,726 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-11-28 02:47:58,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-28 02:47:58,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 98. [2019-11-28 02:47:58,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-28 02:47:58,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2019-11-28 02:47:58,732 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 20 [2019-11-28 02:47:58,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:58,732 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2019-11-28 02:47:58,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 02:47:58,733 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2019-11-28 02:47:58,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 02:47:58,734 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:58,734 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:58,734 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr45ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 02:47:58,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:58,735 INFO L82 PathProgramCache]: Analyzing trace with hash 560416015, now seen corresponding path program 1 times [2019-11-28 02:47:58,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:58,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829426614] [2019-11-28 02:47:58,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:58,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:58,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:58,927 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:58,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829426614] [2019-11-28 02:47:58,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:58,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 02:47:58,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994503399] [2019-11-28 02:47:58,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 02:47:58,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:58,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 02:47:58,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:47:58,941 INFO L87 Difference]: Start difference. First operand 98 states and 111 transitions. Second operand 9 states. [2019-11-28 02:47:59,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:59,549 INFO L93 Difference]: Finished difference Result 156 states and 167 transitions. [2019-11-28 02:47:59,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 02:47:59,550 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-11-28 02:47:59,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:59,552 INFO L225 Difference]: With dead ends: 156 [2019-11-28 02:47:59,552 INFO L226 Difference]: Without dead ends: 156 [2019-11-28 02:47:59,552 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:59,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-11-28 02:47:59,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 98. [2019-11-28 02:47:59,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-28 02:47:59,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2019-11-28 02:47:59,557 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 20 [2019-11-28 02:47:59,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:59,557 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2019-11-28 02:47:59,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 02:47:59,557 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2019-11-28 02:47:59,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 02:47:59,558 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:59,558 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:59,558 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr45ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 02:47:59,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:59,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1476938481, now seen corresponding path program 1 times [2019-11-28 02:47:59,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:59,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685517659] [2019-11-28 02:47:59,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:59,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:59,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:59,611 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:59,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685517659] [2019-11-28 02:47:59,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:59,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 02:47:59,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912342351] [2019-11-28 02:47:59,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:47:59,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:59,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:47:59,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:47:59,613 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand 7 states. [2019-11-28 02:47:59,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:59,940 INFO L93 Difference]: Finished difference Result 146 states and 160 transitions. [2019-11-28 02:47:59,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 02:47:59,941 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-11-28 02:47:59,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:59,942 INFO L225 Difference]: With dead ends: 146 [2019-11-28 02:47:59,943 INFO L226 Difference]: Without dead ends: 146 [2019-11-28 02:47:59,943 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:47:59,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-28 02:47:59,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 96. [2019-11-28 02:47:59,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-28 02:47:59,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2019-11-28 02:47:59,948 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 20 [2019-11-28 02:47:59,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:59,948 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2019-11-28 02:47:59,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:47:59,948 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2019-11-28 02:47:59,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 02:47:59,949 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:59,949 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:59,950 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr45ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 02:47:59,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:59,950 INFO L82 PathProgramCache]: Analyzing trace with hash 193012442, now seen corresponding path program 1 times [2019-11-28 02:47:59,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:59,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243222093] [2019-11-28 02:47:59,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:59,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:00,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:00,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:48:00,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243222093] [2019-11-28 02:48:00,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:48:00,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 02:48:00,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097168688] [2019-11-28 02:48:00,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 02:48:00,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:48:00,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 02:48:00,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:48:00,023 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand 8 states. [2019-11-28 02:48:00,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:48:00,399 INFO L93 Difference]: Finished difference Result 133 states and 148 transitions. [2019-11-28 02:48:00,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 02:48:00,401 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-11-28 02:48:00,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:48:00,402 INFO L225 Difference]: With dead ends: 133 [2019-11-28 02:48:00,402 INFO L226 Difference]: Without dead ends: 133 [2019-11-28 02:48:00,402 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:48:00,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-28 02:48:00,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 97. [2019-11-28 02:48:00,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-28 02:48:00,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2019-11-28 02:48:00,406 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 21 [2019-11-28 02:48:00,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:48:00,406 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2019-11-28 02:48:00,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 02:48:00,407 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2019-11-28 02:48:00,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 02:48:00,408 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:48:00,408 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:48:00,408 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr45ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 02:48:00,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:48:00,408 INFO L82 PathProgramCache]: Analyzing trace with hash 193012443, now seen corresponding path program 1 times [2019-11-28 02:48:00,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:48:00,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624206340] [2019-11-28 02:48:00,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:48:00,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:00,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:00,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:48:00,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624206340] [2019-11-28 02:48:00,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:48:00,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-28 02:48:00,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627210112] [2019-11-28 02:48:00,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 02:48:00,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:48:00,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 02:48:00,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:48:00,646 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand 12 states. [2019-11-28 02:48:01,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:48:01,299 INFO L93 Difference]: Finished difference Result 144 states and 156 transitions. [2019-11-28 02:48:01,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 02:48:01,299 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-11-28 02:48:01,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:48:01,301 INFO L225 Difference]: With dead ends: 144 [2019-11-28 02:48:01,301 INFO L226 Difference]: Without dead ends: 144 [2019-11-28 02:48:01,302 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2019-11-28 02:48:01,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-28 02:48:01,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 116. [2019-11-28 02:48:01,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-11-28 02:48:01,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 143 transitions. [2019-11-28 02:48:01,306 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 143 transitions. Word has length 21 [2019-11-28 02:48:01,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:48:01,307 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 143 transitions. [2019-11-28 02:48:01,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 02:48:01,307 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 143 transitions. [2019-11-28 02:48:01,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 02:48:01,308 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:48:01,308 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:48:01,309 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr45ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 02:48:01,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:48:01,309 INFO L82 PathProgramCache]: Analyzing trace with hash 801367497, now seen corresponding path program 1 times [2019-11-28 02:48:01,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:48:01,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424798925] [2019-11-28 02:48:01,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:48:01,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:01,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:01,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:48:01,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424798925] [2019-11-28 02:48:01,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:48:01,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-28 02:48:01,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669410695] [2019-11-28 02:48:01,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 02:48:01,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:48:01,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 02:48:01,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-11-28 02:48:01,558 INFO L87 Difference]: Start difference. First operand 116 states and 143 transitions. Second operand 13 states. [2019-11-28 02:48:02,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:48:02,170 INFO L93 Difference]: Finished difference Result 154 states and 165 transitions. [2019-11-28 02:48:02,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 02:48:02,171 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-11-28 02:48:02,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:48:02,172 INFO L225 Difference]: With dead ends: 154 [2019-11-28 02:48:02,172 INFO L226 Difference]: Without dead ends: 154 [2019-11-28 02:48:02,173 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2019-11-28 02:48:02,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-28 02:48:02,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 117. [2019-11-28 02:48:02,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-28 02:48:02,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 144 transitions. [2019-11-28 02:48:02,178 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 144 transitions. Word has length 23 [2019-11-28 02:48:02,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:48:02,179 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 144 transitions. [2019-11-28 02:48:02,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 02:48:02,179 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 144 transitions. [2019-11-28 02:48:02,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 02:48:02,180 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:48:02,180 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:48:02,181 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr45ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 02:48:02,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:48:02,181 INFO L82 PathProgramCache]: Analyzing trace with hash -927411151, now seen corresponding path program 1 times [2019-11-28 02:48:02,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:48:02,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288284869] [2019-11-28 02:48:02,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:48:02,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:02,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:48:02,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288284869] [2019-11-28 02:48:02,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:48:02,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 02:48:02,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909183597] [2019-11-28 02:48:02,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 02:48:02,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:48:02,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 02:48:02,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:48:02,335 INFO L87 Difference]: Start difference. First operand 117 states and 144 transitions. Second operand 9 states. [2019-11-28 02:48:02,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:48:02,773 INFO L93 Difference]: Finished difference Result 146 states and 160 transitions. [2019-11-28 02:48:02,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 02:48:02,774 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2019-11-28 02:48:02,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:48:02,775 INFO L225 Difference]: With dead ends: 146 [2019-11-28 02:48:02,775 INFO L226 Difference]: Without dead ends: 146 [2019-11-28 02:48:02,776 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-11-28 02:48:02,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-28 02:48:02,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 118. [2019-11-28 02:48:02,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-11-28 02:48:02,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 145 transitions. [2019-11-28 02:48:02,780 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 145 transitions. Word has length 24 [2019-11-28 02:48:02,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:48:02,781 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 145 transitions. [2019-11-28 02:48:02,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 02:48:02,781 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 145 transitions. [2019-11-28 02:48:02,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 02:48:02,782 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:48:02,782 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:48:02,783 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr45ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 02:48:02,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:48:02,783 INFO L82 PathProgramCache]: Analyzing trace with hash -483711363, now seen corresponding path program 1 times [2019-11-28 02:48:02,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:48:02,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737769260] [2019-11-28 02:48:02,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:48:02,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:03,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:03,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:48:03,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737769260] [2019-11-28 02:48:03,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:48:03,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-28 02:48:03,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241860524] [2019-11-28 02:48:03,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 02:48:03,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:48:03,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 02:48:03,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-11-28 02:48:03,061 INFO L87 Difference]: Start difference. First operand 118 states and 145 transitions. Second operand 13 states. [2019-11-28 02:48:03,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:48:03,766 INFO L93 Difference]: Finished difference Result 141 states and 152 transitions. [2019-11-28 02:48:03,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 02:48:03,767 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2019-11-28 02:48:03,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:48:03,768 INFO L225 Difference]: With dead ends: 141 [2019-11-28 02:48:03,768 INFO L226 Difference]: Without dead ends: 141 [2019-11-28 02:48:03,769 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:48:03,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-11-28 02:48:03,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 118. [2019-11-28 02:48:03,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-11-28 02:48:03,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 144 transitions. [2019-11-28 02:48:03,773 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 144 transitions. Word has length 24 [2019-11-28 02:48:03,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:48:03,773 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 144 transitions. [2019-11-28 02:48:03,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 02:48:03,774 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 144 transitions. [2019-11-28 02:48:03,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 02:48:03,774 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:48:03,775 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:48:03,775 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr45ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 02:48:03,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:48:03,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1598203218, now seen corresponding path program 1 times [2019-11-28 02:48:03,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:48:03,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160575259] [2019-11-28 02:48:03,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:48:03,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:03,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:03,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:48:03,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160575259] [2019-11-28 02:48:03,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:48:03,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 02:48:03,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598196672] [2019-11-28 02:48:03,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:48:03,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:48:03,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:48:03,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:48:03,817 INFO L87 Difference]: Start difference. First operand 118 states and 144 transitions. Second operand 4 states. [2019-11-28 02:48:03,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:48:03,939 INFO L93 Difference]: Finished difference Result 185 states and 216 transitions. [2019-11-28 02:48:03,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:48:03,939 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-28 02:48:03,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:48:03,942 INFO L225 Difference]: With dead ends: 185 [2019-11-28 02:48:03,942 INFO L226 Difference]: Without dead ends: 185 [2019-11-28 02:48:03,942 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:48:03,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-28 02:48:03,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 130. [2019-11-28 02:48:03,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-28 02:48:03,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 158 transitions. [2019-11-28 02:48:03,950 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 158 transitions. Word has length 24 [2019-11-28 02:48:03,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:48:03,950 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 158 transitions. [2019-11-28 02:48:03,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:48:03,950 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 158 transitions. [2019-11-28 02:48:03,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 02:48:03,953 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:48:03,953 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:48:03,954 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr45ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 02:48:03,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:48:03,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1315071323, now seen corresponding path program 1 times [2019-11-28 02:48:03,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:48:03,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271698459] [2019-11-28 02:48:03,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:48:03,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:04,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:04,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:48:04,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271698459] [2019-11-28 02:48:04,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:48:04,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 02:48:04,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559757716] [2019-11-28 02:48:04,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 02:48:04,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:48:04,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 02:48:04,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:48:04,080 INFO L87 Difference]: Start difference. First operand 130 states and 158 transitions. Second operand 9 states. [2019-11-28 02:48:04,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:48:04,404 INFO L93 Difference]: Finished difference Result 150 states and 166 transitions. [2019-11-28 02:48:04,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 02:48:04,404 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-11-28 02:48:04,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:48:04,406 INFO L225 Difference]: With dead ends: 150 [2019-11-28 02:48:04,406 INFO L226 Difference]: Without dead ends: 150 [2019-11-28 02:48:04,406 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:48:04,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-28 02:48:04,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 132. [2019-11-28 02:48:04,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-28 02:48:04,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 160 transitions. [2019-11-28 02:48:04,411 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 160 transitions. Word has length 25 [2019-11-28 02:48:04,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:48:04,411 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 160 transitions. [2019-11-28 02:48:04,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 02:48:04,411 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 160 transitions. [2019-11-28 02:48:04,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 02:48:04,412 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:48:04,412 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:48:04,412 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr45ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 02:48:04,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:48:04,412 INFO L82 PathProgramCache]: Analyzing trace with hash -2110522547, now seen corresponding path program 1 times [2019-11-28 02:48:04,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:48:04,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180582721] [2019-11-28 02:48:04,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:48:04,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:04,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:04,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:48:04,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180582721] [2019-11-28 02:48:04,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:48:04,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 02:48:04,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813810478] [2019-11-28 02:48:04,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:48:04,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:48:04,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:48:04,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:48:04,465 INFO L87 Difference]: Start difference. First operand 132 states and 160 transitions. Second operand 6 states. [2019-11-28 02:48:04,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:48:04,681 INFO L93 Difference]: Finished difference Result 133 states and 161 transitions. [2019-11-28 02:48:04,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:48:04,682 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-11-28 02:48:04,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:48:04,683 INFO L225 Difference]: With dead ends: 133 [2019-11-28 02:48:04,683 INFO L226 Difference]: Without dead ends: 133 [2019-11-28 02:48:04,684 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:48:04,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-28 02:48:04,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2019-11-28 02:48:04,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-28 02:48:04,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 157 transitions. [2019-11-28 02:48:04,688 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 157 transitions. Word has length 25 [2019-11-28 02:48:04,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:48:04,689 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 157 transitions. [2019-11-28 02:48:04,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:48:04,689 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 157 transitions. [2019-11-28 02:48:04,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 02:48:04,689 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:48:04,690 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:48:04,690 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr45ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 02:48:04,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:48:04,690 INFO L82 PathProgramCache]: Analyzing trace with hash -2110522546, now seen corresponding path program 1 times [2019-11-28 02:48:04,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:48:04,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436041953] [2019-11-28 02:48:04,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:48:04,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:04,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:04,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:48:04,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436041953] [2019-11-28 02:48:04,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:48:04,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-28 02:48:04,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180917154] [2019-11-28 02:48:04,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 02:48:04,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:48:04,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 02:48:04,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-28 02:48:04,846 INFO L87 Difference]: Start difference. First operand 131 states and 157 transitions. Second operand 11 states. [2019-11-28 02:48:05,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:48:05,436 INFO L93 Difference]: Finished difference Result 151 states and 164 transitions. [2019-11-28 02:48:05,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 02:48:05,437 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-11-28 02:48:05,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:48:05,438 INFO L225 Difference]: With dead ends: 151 [2019-11-28 02:48:05,438 INFO L226 Difference]: Without dead ends: 151 [2019-11-28 02:48:05,439 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:48:05,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-11-28 02:48:05,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 131. [2019-11-28 02:48:05,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-28 02:48:05,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 156 transitions. [2019-11-28 02:48:05,444 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 156 transitions. Word has length 25 [2019-11-28 02:48:05,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:48:05,444 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 156 transitions. [2019-11-28 02:48:05,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 02:48:05,445 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 156 transitions. [2019-11-28 02:48:05,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 02:48:05,445 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:48:05,446 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:48:05,446 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr45ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 02:48:05,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:48:05,446 INFO L82 PathProgramCache]: Analyzing trace with hash 2111088500, now seen corresponding path program 1 times [2019-11-28 02:48:05,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:48:05,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440119153] [2019-11-28 02:48:05,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:48:05,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:05,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:05,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:48:05,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440119153] [2019-11-28 02:48:05,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:48:05,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-28 02:48:05,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139243965] [2019-11-28 02:48:05,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 02:48:05,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:48:05,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 02:48:05,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:48:05,687 INFO L87 Difference]: Start difference. First operand 131 states and 156 transitions. Second operand 10 states. [2019-11-28 02:48:06,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:48:06,235 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2019-11-28 02:48:06,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 02:48:06,238 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-11-28 02:48:06,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:48:06,239 INFO L225 Difference]: With dead ends: 149 [2019-11-28 02:48:06,239 INFO L226 Difference]: Without dead ends: 149 [2019-11-28 02:48:06,240 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:48:06,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-28 02:48:06,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 131. [2019-11-28 02:48:06,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-28 02:48:06,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 155 transitions. [2019-11-28 02:48:06,244 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 155 transitions. Word has length 26 [2019-11-28 02:48:06,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:48:06,244 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 155 transitions. [2019-11-28 02:48:06,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 02:48:06,245 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 155 transitions. [2019-11-28 02:48:06,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 02:48:06,245 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:48:06,245 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:48:06,246 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr45ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 02:48:06,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:48:06,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1023526327, now seen corresponding path program 1 times [2019-11-28 02:48:06,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:48:06,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703967398] [2019-11-28 02:48:06,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:48:06,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:06,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:06,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:48:06,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703967398] [2019-11-28 02:48:06,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896268140] [2019-11-28 02:48:06,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:48:06,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:48:06,534 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-28 02:48:06,541 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:48:06,630 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:48:06,631 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-28 02:48:06,632 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:48:06,639 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:48:06,640 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:48:06,640 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:15 [2019-11-28 02:48:06,671 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-28 02:48:06,671 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:48:06,685 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:48:06,686 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:48:06,687 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2019-11-28 02:48:06,783 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:48:06,784 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 50 [2019-11-28 02:48:06,785 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:48:06,810 INFO L588 ElimStorePlain]: treesize reduction 24, result has 48.9 percent of original size [2019-11-28 02:48:06,810 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:48:06,811 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:23 [2019-11-28 02:48:06,859 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-28 02:48:06,860 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-28 02:48:06,861 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:48:06,869 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:48:06,869 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:48:06,870 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:23 [2019-11-28 02:48:06,929 INFO L343 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2019-11-28 02:48:06,930 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 78 [2019-11-28 02:48:06,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 02:48:06,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:48:06,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:48:06,940 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-28 02:48:06,961 INFO L588 ElimStorePlain]: treesize reduction 80, result has 25.9 percent of original size [2019-11-28 02:48:06,962 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 02:48:06,962 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:28 [2019-11-28 02:48:07,031 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:48:07,032 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 30 [2019-11-28 02:48:07,033 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:48:07,036 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:48:07,037 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:48:07,037 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:4 [2019-11-28 02:48:07,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:48:07,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:48:07,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 19 [2019-11-28 02:48:07,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287143283] [2019-11-28 02:48:07,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-28 02:48:07,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:48:07,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-28 02:48:07,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2019-11-28 02:48:07,049 INFO L87 Difference]: Start difference. First operand 131 states and 155 transitions. Second operand 19 states. [2019-11-28 02:48:08,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:48:08,180 INFO L93 Difference]: Finished difference Result 232 states and 263 transitions. [2019-11-28 02:48:08,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-28 02:48:08,180 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 27 [2019-11-28 02:48:08,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:48:08,182 INFO L225 Difference]: With dead ends: 232 [2019-11-28 02:48:08,182 INFO L226 Difference]: Without dead ends: 232 [2019-11-28 02:48:08,183 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=159, Invalid=711, Unknown=0, NotChecked=0, Total=870 [2019-11-28 02:48:08,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-11-28 02:48:08,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 152. [2019-11-28 02:48:08,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-28 02:48:08,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 179 transitions. [2019-11-28 02:48:08,189 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 179 transitions. Word has length 27 [2019-11-28 02:48:08,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:48:08,190 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 179 transitions. [2019-11-28 02:48:08,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-28 02:48:08,190 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 179 transitions. [2019-11-28 02:48:08,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 02:48:08,191 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:48:08,191 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:48:08,398 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:48:08,399 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr45ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 02:48:08,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:48:08,399 INFO L82 PathProgramCache]: Analyzing trace with hash -550852041, now seen corresponding path program 1 times [2019-11-28 02:48:08,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:48:08,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397999274] [2019-11-28 02:48:08,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:48:08,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:48:08,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:48:08,457 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:48:08,457 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 02:48:08,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:48:08 BoogieIcfgContainer [2019-11-28 02:48:08,520 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 02:48:08,520 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 02:48:08,520 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 02:48:08,520 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 02:48:08,521 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:52" (3/4) ... [2019-11-28 02:48:08,523 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 02:48:08,576 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 02:48:08,576 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 02:48:08,578 INFO L168 Benchmark]: Toolchain (without parser) took 17038.33 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 348.1 MB). Free memory was 959.0 MB in the beginning and 1.0 GB in the end (delta: -64.5 MB). Peak memory consumption was 283.6 MB. Max. memory is 11.5 GB. [2019-11-28 02:48:08,578 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:48:08,579 INFO L168 Benchmark]: CACSL2BoogieTranslator took 598.61 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -143.6 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:48:08,579 INFO L168 Benchmark]: Boogie Preprocessor took 67.10 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 11.5 GB. [2019-11-28 02:48:08,580 INFO L168 Benchmark]: RCFGBuilder took 706.81 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 53.2 MB). Peak memory consumption was 53.2 MB. Max. memory is 11.5 GB. [2019-11-28 02:48:08,586 INFO L168 Benchmark]: TraceAbstraction took 15603.39 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 233.3 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 12.1 MB). Peak memory consumption was 245.4 MB. Max. memory is 11.5 GB. [2019-11-28 02:48:08,586 INFO L168 Benchmark]: Witness Printer took 56.43 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:48:08,588 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 598.61 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -143.6 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 67.10 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 706.81 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 53.2 MB). Peak memory consumption was 53.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15603.39 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 233.3 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 12.1 MB). Peak memory consumption was 245.4 MB. Max. memory is 11.5 GB. * Witness Printer took 56.43 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: 1021]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L985] SLL* head = malloc(sizeof(SLL)); VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}] [L986] head->next = head VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}] [L987] head->data = 0 VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}] [L989] SLL* x = head; [L990] int state = 1; VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}] [L993] COND FALSE !(__VERIFIER_nondet_int()) [L1014] x->data = state VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}] [L1016] EXPR head->next VAL [head={-1:0}, head->next={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}] [L1016] x = head->next [L1017] COND FALSE !(!(((void*)0) != x)) VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}] [L1019] EXPR x->data VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}, x->data=1] [L1019] COND TRUE x->data != 0 [L1021] EXPR x->next VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}, x->next={-1:0}] [L1021] 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] [L1021] 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] [L1021] 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] [L1021] 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] [L1021] 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] [L1021] 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] [L1021] COND TRUE !(x->next->data != 0 && x->data > x->next->data) [L1021] __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, 106 locations, 46 error locations. Result: UNSAFE, OverallTime: 15.4s, OverallIterations: 24, TraceHistogramMax: 2, AutomataDifference: 10.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1551 SDtfs, 4075 SDslu, 5122 SDs, 0 SdLazy, 7208 SolverSat, 357 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 361 GetRequests, 91 SyntacticMatches, 9 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred in iteration=23, 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, 23 MinimizatonAttempts, 841 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 498 NumberOfCodeBlocks, 498 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 446 ConstructedInterpolants, 1 QuantifiedInterpolants, 83109 SizeOfPredicates, 9 NumberOfNonLiveVariables, 142 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 24 InterpolantComputations, 22 PerfectInterpolantSequences, 0/4 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...