./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/forester-heap/dll-simple-white-blue-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/dll-simple-white-blue-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f369e67185304fce6130a1dfc66e8cb89abf0605 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:32,489 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 02:47:32,491 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 02:47:32,504 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 02:47:32,504 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 02:47:32,506 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 02:47:32,507 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 02:47:32,509 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 02:47:32,511 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 02:47:32,512 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 02:47:32,513 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 02:47:32,514 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 02:47:32,515 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 02:47:32,516 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 02:47:32,517 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 02:47:32,518 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 02:47:32,519 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 02:47:32,520 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 02:47:32,522 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 02:47:32,524 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 02:47:32,526 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 02:47:32,527 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 02:47:32,528 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 02:47:32,529 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 02:47:32,532 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 02:47:32,532 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 02:47:32,532 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 02:47:32,533 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 02:47:32,534 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 02:47:32,535 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 02:47:32,535 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 02:47:32,536 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 02:47:32,537 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 02:47:32,538 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 02:47:32,539 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 02:47:32,539 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 02:47:32,540 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 02:47:32,540 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 02:47:32,540 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 02:47:32,541 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 02:47:32,542 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 02:47:32,543 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:32,558 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 02:47:32,558 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 02:47:32,559 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 02:47:32,560 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 02:47:32,560 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 02:47:32,560 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 02:47:32,560 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 02:47:32,561 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 02:47:32,561 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 02:47:32,561 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 02:47:32,561 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 02:47:32,562 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 02:47:32,562 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 02:47:32,562 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 02:47:32,562 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 02:47:32,562 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 02:47:32,563 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 02:47:32,563 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 02:47:32,563 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 02:47:32,563 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 02:47:32,563 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 02:47:32,564 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:47:32,564 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 02:47:32,564 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 02:47:32,564 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 02:47:32,565 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 02:47:32,565 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 -> f369e67185304fce6130a1dfc66e8cb89abf0605 [2019-11-28 02:47:32,876 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 02:47:32,896 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 02:47:32,899 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 02:47:32,900 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 02:47:32,901 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 02:47:32,901 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-simple-white-blue-1.i [2019-11-28 02:47:32,961 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc675905d/2343216d10644e76b723ebf0e68b4194/FLAG9b55f4a9f [2019-11-28 02:47:33,524 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 02:47:33,525 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-simple-white-blue-1.i [2019-11-28 02:47:33,537 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc675905d/2343216d10644e76b723ebf0e68b4194/FLAG9b55f4a9f [2019-11-28 02:47:33,799 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc675905d/2343216d10644e76b723ebf0e68b4194 [2019-11-28 02:47:33,802 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 02:47:33,803 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 02:47:33,804 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 02:47:33,804 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 02:47:33,808 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 02:47:33,809 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:47:33" (1/1) ... [2019-11-28 02:47:33,812 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c1dbb8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:33, skipping insertion in model container [2019-11-28 02:47:33,812 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:47:33" (1/1) ... [2019-11-28 02:47:33,820 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 02:47:33,869 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 02:47:34,312 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:47:34,330 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 02:47:34,388 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:47:34,440 INFO L208 MainTranslator]: Completed translation [2019-11-28 02:47:34,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:34 WrapperNode [2019-11-28 02:47:34,441 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 02:47:34,442 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 02:47:34,442 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 02:47:34,442 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 02:47:34,456 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:34" (1/1) ... [2019-11-28 02:47:34,456 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:34" (1/1) ... [2019-11-28 02:47:34,474 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:34" (1/1) ... [2019-11-28 02:47:34,474 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:34" (1/1) ... [2019-11-28 02:47:34,496 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:34" (1/1) ... [2019-11-28 02:47:34,503 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:34" (1/1) ... [2019-11-28 02:47:34,506 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:34" (1/1) ... [2019-11-28 02:47:34,512 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 02:47:34,516 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 02:47:34,516 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 02:47:34,516 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 02:47:34,517 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:34" (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:34,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 02:47:34,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 02:47:34,575 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 02:47:34,575 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-28 02:47:34,575 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-28 02:47:34,576 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-28 02:47:34,576 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-28 02:47:34,576 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-28 02:47:34,576 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-28 02:47:34,577 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-28 02:47:34,577 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-28 02:47:34,577 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-28 02:47:34,577 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-28 02:47:34,578 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-28 02:47:34,578 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-28 02:47:34,578 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-28 02:47:34,578 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-28 02:47:34,579 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-28 02:47:34,579 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-28 02:47:34,579 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-28 02:47:34,579 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-28 02:47:34,579 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-28 02:47:34,580 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-28 02:47:34,580 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-28 02:47:34,580 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-28 02:47:34,580 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-28 02:47:34,581 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-28 02:47:34,581 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-28 02:47:34,581 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-28 02:47:34,581 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-28 02:47:34,582 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-28 02:47:34,582 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-28 02:47:34,582 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-28 02:47:34,582 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-28 02:47:34,582 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-28 02:47:34,583 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-28 02:47:34,583 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-28 02:47:34,583 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-28 02:47:34,583 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-28 02:47:34,584 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-28 02:47:34,584 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-28 02:47:34,584 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-28 02:47:34,584 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-28 02:47:34,584 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-28 02:47:34,585 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-28 02:47:34,585 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-28 02:47:34,585 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-28 02:47:34,585 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-28 02:47:34,585 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-28 02:47:34,586 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-28 02:47:34,586 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-28 02:47:34,586 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-28 02:47:34,586 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-28 02:47:34,587 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-28 02:47:34,587 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-28 02:47:34,587 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-28 02:47:34,587 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-28 02:47:34,587 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-28 02:47:34,588 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-28 02:47:34,588 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-28 02:47:34,588 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-28 02:47:34,588 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-28 02:47:34,590 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-28 02:47:34,590 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-28 02:47:34,590 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-28 02:47:34,590 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-28 02:47:34,590 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-28 02:47:34,591 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-28 02:47:34,592 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-28 02:47:34,592 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-28 02:47:34,592 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-28 02:47:34,592 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-28 02:47:34,592 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-28 02:47:34,592 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-28 02:47:34,592 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-28 02:47:34,593 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-28 02:47:34,593 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-28 02:47:34,593 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-28 02:47:34,593 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-28 02:47:34,593 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-28 02:47:34,593 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-28 02:47:34,593 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-28 02:47:34,594 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-28 02:47:34,596 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-28 02:47:34,596 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-28 02:47:34,596 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-28 02:47:34,596 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-28 02:47:34,596 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-28 02:47:34,597 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-28 02:47:34,597 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-28 02:47:34,597 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-28 02:47:34,597 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-28 02:47:34,597 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-28 02:47:34,597 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-28 02:47:34,597 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-28 02:47:34,598 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-28 02:47:34,598 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-28 02:47:34,598 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-28 02:47:34,598 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-28 02:47:34,598 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-28 02:47:34,598 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-28 02:47:34,598 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-28 02:47:34,598 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-28 02:47:34,599 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-28 02:47:34,599 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-28 02:47:34,599 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-28 02:47:34,599 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-28 02:47:34,599 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-28 02:47:34,599 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 02:47:34,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 02:47:34,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 02:47:34,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 02:47:34,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 02:47:34,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 02:47:34,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 02:47:34,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 02:47:34,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 02:47:35,375 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 02:47:35,376 INFO L297 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 02:47:35,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:47:35 BoogieIcfgContainer [2019-11-28 02:47:35,377 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 02:47:35,379 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 02:47:35,379 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 02:47:35,382 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 02:47:35,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:47:33" (1/3) ... [2019-11-28 02:47:35,383 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bfd0fe7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:47:35, skipping insertion in model container [2019-11-28 02:47:35,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:34" (2/3) ... [2019-11-28 02:47:35,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bfd0fe7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:47:35, skipping insertion in model container [2019-11-28 02:47:35,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:47:35" (3/3) ... [2019-11-28 02:47:35,386 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-simple-white-blue-1.i [2019-11-28 02:47:35,397 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 02:47:35,405 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 61 error locations. [2019-11-28 02:47:35,418 INFO L249 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2019-11-28 02:47:35,436 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 02:47:35,437 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 02:47:35,437 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 02:47:35,437 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 02:47:35,437 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 02:47:35,438 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 02:47:35,438 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 02:47:35,438 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 02:47:35,457 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states. [2019-11-28 02:47:35,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-28 02:47:35,467 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:35,468 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:35,469 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_LEAK, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-11-28 02:47:35,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:35,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1597394023, now seen corresponding path program 1 times [2019-11-28 02:47:35,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:35,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578810585] [2019-11-28 02:47:35,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:35,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:35,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:35,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:47:35,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578810585] [2019-11-28 02:47:35,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:35,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:47:35,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095027023] [2019-11-28 02:47:35,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:47:35,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:35,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:47:35,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:47:35,711 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 4 states. [2019-11-28 02:47:36,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:36,198 INFO L93 Difference]: Finished difference Result 156 states and 166 transitions. [2019-11-28 02:47:36,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:47:36,201 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-28 02:47:36,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:36,213 INFO L225 Difference]: With dead ends: 156 [2019-11-28 02:47:36,214 INFO L226 Difference]: Without dead ends: 152 [2019-11-28 02:47:36,216 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:47:36,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-28 02:47:36,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 123. [2019-11-28 02:47:36,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-11-28 02:47:36,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 130 transitions. [2019-11-28 02:47:36,293 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 130 transitions. Word has length 7 [2019-11-28 02:47:36,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:36,297 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 130 transitions. [2019-11-28 02:47:36,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:47:36,298 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 130 transitions. [2019-11-28 02:47:36,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-28 02:47:36,298 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:36,298 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:36,299 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_LEAK, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-11-28 02:47:36,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:36,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1597394022, now seen corresponding path program 1 times [2019-11-28 02:47:36,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:36,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392057933] [2019-11-28 02:47:36,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:36,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:36,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:36,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:47:36,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392057933] [2019-11-28 02:47:36,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:36,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:47:36,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355242606] [2019-11-28 02:47:36,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:47:36,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:36,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:47:36,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:47:36,431 INFO L87 Difference]: Start difference. First operand 123 states and 130 transitions. Second operand 4 states. [2019-11-28 02:47:36,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:36,809 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions. [2019-11-28 02:47:36,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:47:36,810 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-28 02:47:36,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:36,812 INFO L225 Difference]: With dead ends: 149 [2019-11-28 02:47:36,813 INFO L226 Difference]: Without dead ends: 149 [2019-11-28 02:47:36,814 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:36,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-28 02:47:36,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 120. [2019-11-28 02:47:36,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-28 02:47:36,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 127 transitions. [2019-11-28 02:47:36,823 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 127 transitions. Word has length 7 [2019-11-28 02:47:36,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:36,824 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 127 transitions. [2019-11-28 02:47:36,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:47:36,824 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 127 transitions. [2019-11-28 02:47:36,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 02:47:36,825 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:36,825 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:36,826 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_LEAK, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-11-28 02:47:36,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:36,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1796456478, now seen corresponding path program 1 times [2019-11-28 02:47:36,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:36,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629980000] [2019-11-28 02:47:36,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:36,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:36,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:36,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:47:36,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629980000] [2019-11-28 02:47:36,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:36,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 02:47:36,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080616405] [2019-11-28 02:47:36,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:47:36,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:36,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:47:36,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:47:36,947 INFO L87 Difference]: Start difference. First operand 120 states and 127 transitions. Second operand 5 states. [2019-11-28 02:47:37,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:37,302 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2019-11-28 02:47:37,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:47:37,303 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-28 02:47:37,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:37,304 INFO L225 Difference]: With dead ends: 120 [2019-11-28 02:47:37,304 INFO L226 Difference]: Without dead ends: 120 [2019-11-28 02:47:37,305 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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:37,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-28 02:47:37,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 112. [2019-11-28 02:47:37,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-28 02:47:37,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 125 transitions. [2019-11-28 02:47:37,314 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 125 transitions. Word has length 13 [2019-11-28 02:47:37,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:37,315 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 125 transitions. [2019-11-28 02:47:37,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:47:37,315 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 125 transitions. [2019-11-28 02:47:37,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 02:47:37,316 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:37,316 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:37,316 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_LEAK, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-11-28 02:47:37,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:37,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1796456477, now seen corresponding path program 1 times [2019-11-28 02:47:37,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:37,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179298799] [2019-11-28 02:47:37,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:37,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:37,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:37,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:47:37,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179298799] [2019-11-28 02:47:37,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:37,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 02:47:37,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459849316] [2019-11-28 02:47:37,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:47:37,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:37,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:47:37,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:47:37,438 INFO L87 Difference]: Start difference. First operand 112 states and 125 transitions. Second operand 5 states. [2019-11-28 02:47:37,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:37,847 INFO L93 Difference]: Finished difference Result 144 states and 156 transitions. [2019-11-28 02:47:37,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:47:37,848 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-28 02:47:37,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:37,850 INFO L225 Difference]: With dead ends: 144 [2019-11-28 02:47:37,850 INFO L226 Difference]: Without dead ends: 144 [2019-11-28 02:47:37,851 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:37,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-28 02:47:37,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 126. [2019-11-28 02:47:37,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-28 02:47:37,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 141 transitions. [2019-11-28 02:47:37,877 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 141 transitions. Word has length 13 [2019-11-28 02:47:37,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:37,877 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 141 transitions. [2019-11-28 02:47:37,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:47:37,878 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 141 transitions. [2019-11-28 02:47:37,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 02:47:37,882 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:37,882 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:37,882 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_LEAK, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-11-28 02:47:37,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:37,883 INFO L82 PathProgramCache]: Analyzing trace with hash 182177509, now seen corresponding path program 1 times [2019-11-28 02:47:37,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:37,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142492975] [2019-11-28 02:47:37,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:37,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:38,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:38,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:47:38,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142492975] [2019-11-28 02:47:38,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:38,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 02:47:38,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514018829] [2019-11-28 02:47:38,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:47:38,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:38,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:47:38,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:47:38,017 INFO L87 Difference]: Start difference. First operand 126 states and 141 transitions. Second operand 6 states. [2019-11-28 02:47:38,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:38,581 INFO L93 Difference]: Finished difference Result 206 states and 229 transitions. [2019-11-28 02:47:38,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:47:38,582 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-28 02:47:38,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:38,584 INFO L225 Difference]: With dead ends: 206 [2019-11-28 02:47:38,584 INFO L226 Difference]: Without dead ends: 206 [2019-11-28 02:47:38,584 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:47:38,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-11-28 02:47:38,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 125. [2019-11-28 02:47:38,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-11-28 02:47:38,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 139 transitions. [2019-11-28 02:47:38,593 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 139 transitions. Word has length 15 [2019-11-28 02:47:38,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:38,594 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 139 transitions. [2019-11-28 02:47:38,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:47:38,594 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 139 transitions. [2019-11-28 02:47:38,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 02:47:38,595 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:38,595 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:38,595 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_LEAK, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-11-28 02:47:38,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:38,596 INFO L82 PathProgramCache]: Analyzing trace with hash 182177510, now seen corresponding path program 1 times [2019-11-28 02:47:38,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:38,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353348313] [2019-11-28 02:47:38,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:38,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:38,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:38,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:47:38,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353348313] [2019-11-28 02:47:38,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:38,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 02:47:38,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549885965] [2019-11-28 02:47:38,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:47:38,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:38,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:47:38,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:47:38,682 INFO L87 Difference]: Start difference. First operand 125 states and 139 transitions. Second operand 6 states. [2019-11-28 02:47:39,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:39,339 INFO L93 Difference]: Finished difference Result 215 states and 239 transitions. [2019-11-28 02:47:39,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:47:39,340 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-28 02:47:39,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:39,342 INFO L225 Difference]: With dead ends: 215 [2019-11-28 02:47:39,342 INFO L226 Difference]: Without dead ends: 215 [2019-11-28 02:47:39,342 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:47:39,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-11-28 02:47:39,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 124. [2019-11-28 02:47:39,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-28 02:47:39,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 137 transitions. [2019-11-28 02:47:39,349 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 137 transitions. Word has length 15 [2019-11-28 02:47:39,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:39,350 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 137 transitions. [2019-11-28 02:47:39,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:47:39,350 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 137 transitions. [2019-11-28 02:47:39,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 02:47:39,351 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:39,351 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:39,351 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_LEAK, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-11-28 02:47:39,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:39,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1998534361, now seen corresponding path program 1 times [2019-11-28 02:47:39,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:39,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444944745] [2019-11-28 02:47:39,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:39,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:39,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:39,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:47:39,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444944745] [2019-11-28 02:47:39,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:39,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 02:47:39,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032738650] [2019-11-28 02:47:39,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 02:47:39,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:39,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 02:47:39,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:47:39,510 INFO L87 Difference]: Start difference. First operand 124 states and 137 transitions. Second operand 10 states. [2019-11-28 02:47:40,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:40,177 INFO L93 Difference]: Finished difference Result 128 states and 139 transitions. [2019-11-28 02:47:40,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 02:47:40,178 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-11-28 02:47:40,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:40,179 INFO L225 Difference]: With dead ends: 128 [2019-11-28 02:47:40,180 INFO L226 Difference]: Without dead ends: 128 [2019-11-28 02:47:40,180 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-11-28 02:47:40,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-11-28 02:47:40,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 123. [2019-11-28 02:47:40,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-11-28 02:47:40,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 136 transitions. [2019-11-28 02:47:40,185 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 136 transitions. Word has length 19 [2019-11-28 02:47:40,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:40,186 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 136 transitions. [2019-11-28 02:47:40,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 02:47:40,186 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 136 transitions. [2019-11-28 02:47:40,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 02:47:40,187 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:40,187 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:40,187 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_LEAK, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-11-28 02:47:40,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:40,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1998534360, now seen corresponding path program 1 times [2019-11-28 02:47:40,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:40,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936215269] [2019-11-28 02:47:40,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:40,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:40,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:40,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:47:40,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936215269] [2019-11-28 02:47:40,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:40,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-28 02:47:40,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304065849] [2019-11-28 02:47:40,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 02:47:40,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:40,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 02:47:40,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-28 02:47:40,346 INFO L87 Difference]: Start difference. First operand 123 states and 136 transitions. Second operand 11 states. [2019-11-28 02:47:41,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:41,348 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2019-11-28 02:47:41,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 02:47:41,349 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-11-28 02:47:41,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:41,351 INFO L225 Difference]: With dead ends: 126 [2019-11-28 02:47:41,351 INFO L226 Difference]: Without dead ends: 126 [2019-11-28 02:47:41,352 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-11-28 02:47:41,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-11-28 02:47:41,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 111. [2019-11-28 02:47:41,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-28 02:47:41,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 123 transitions. [2019-11-28 02:47:41,357 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 123 transitions. Word has length 19 [2019-11-28 02:47:41,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:41,358 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 123 transitions. [2019-11-28 02:47:41,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 02:47:41,358 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2019-11-28 02:47:41,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 02:47:41,361 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:41,361 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:41,362 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_LEAK, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-11-28 02:47:41,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:41,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1021234684, now seen corresponding path program 1 times [2019-11-28 02:47:41,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:41,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519688467] [2019-11-28 02:47:41,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:41,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:41,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:41,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:47:41,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519688467] [2019-11-28 02:47:41,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:41,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 02:47:41,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630163310] [2019-11-28 02:47:41,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:47:41,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:41,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:47:41,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:47:41,516 INFO L87 Difference]: Start difference. First operand 111 states and 123 transitions. Second operand 6 states. [2019-11-28 02:47:41,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:41,839 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2019-11-28 02:47:41,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:47:41,839 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-11-28 02:47:41,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:41,841 INFO L225 Difference]: With dead ends: 122 [2019-11-28 02:47:41,841 INFO L226 Difference]: Without dead ends: 122 [2019-11-28 02:47:41,842 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:47:41,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-11-28 02:47:41,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 117. [2019-11-28 02:47:41,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-28 02:47:41,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 131 transitions. [2019-11-28 02:47:41,847 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 131 transitions. Word has length 20 [2019-11-28 02:47:41,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:41,848 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 131 transitions. [2019-11-28 02:47:41,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:47:41,849 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 131 transitions. [2019-11-28 02:47:41,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 02:47:41,850 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:41,850 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:41,850 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_LEAK, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-11-28 02:47:41,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:41,851 INFO L82 PathProgramCache]: Analyzing trace with hash 617515280, now seen corresponding path program 1 times [2019-11-28 02:47:41,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:41,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82402120] [2019-11-28 02:47:41,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:41,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:41,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:41,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:47:41,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82402120] [2019-11-28 02:47:41,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:41,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 02:47:41,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799455181] [2019-11-28 02:47:41,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:47:41,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:41,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:47:41,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:47:41,922 INFO L87 Difference]: Start difference. First operand 117 states and 131 transitions. Second operand 7 states. [2019-11-28 02:47:42,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:42,369 INFO L93 Difference]: Finished difference Result 153 states and 170 transitions. [2019-11-28 02:47:42,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 02:47:42,370 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-11-28 02:47:42,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:42,371 INFO L225 Difference]: With dead ends: 153 [2019-11-28 02:47:42,371 INFO L226 Difference]: Without dead ends: 153 [2019-11-28 02:47:42,372 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:47:42,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-28 02:47:42,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 116. [2019-11-28 02:47:42,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-11-28 02:47:42,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 130 transitions. [2019-11-28 02:47:42,376 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 130 transitions. Word has length 22 [2019-11-28 02:47:42,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:42,377 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 130 transitions. [2019-11-28 02:47:42,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:47:42,377 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 130 transitions. [2019-11-28 02:47:42,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 02:47:42,378 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:42,378 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:42,378 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_LEAK, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-11-28 02:47:42,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:42,379 INFO L82 PathProgramCache]: Analyzing trace with hash 617515281, now seen corresponding path program 1 times [2019-11-28 02:47:42,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:42,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928017045] [2019-11-28 02:47:42,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:42,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:42,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:42,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:47:42,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928017045] [2019-11-28 02:47:42,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:42,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 02:47:42,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971917149] [2019-11-28 02:47:42,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:47:42,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:42,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:47:42,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:47:42,467 INFO L87 Difference]: Start difference. First operand 116 states and 130 transitions. Second operand 7 states. [2019-11-28 02:47:42,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:42,891 INFO L93 Difference]: Finished difference Result 159 states and 178 transitions. [2019-11-28 02:47:42,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 02:47:42,891 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-11-28 02:47:42,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:42,893 INFO L225 Difference]: With dead ends: 159 [2019-11-28 02:47:42,893 INFO L226 Difference]: Without dead ends: 159 [2019-11-28 02:47:42,894 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:47:42,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-28 02:47:42,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 113. [2019-11-28 02:47:42,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-28 02:47:42,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 127 transitions. [2019-11-28 02:47:42,898 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 127 transitions. Word has length 22 [2019-11-28 02:47:42,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:42,898 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 127 transitions. [2019-11-28 02:47:42,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:47:42,898 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2019-11-28 02:47:42,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 02:47:42,899 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:42,899 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:42,900 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_LEAK, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-11-28 02:47:42,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:42,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1393880153, now seen corresponding path program 1 times [2019-11-28 02:47:42,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:42,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367381959] [2019-11-28 02:47:42,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:42,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:43,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:43,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:47:43,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367381959] [2019-11-28 02:47:43,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593335989] [2019-11-28 02:47:43,023 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:47:43,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:43,141 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-28 02:47:43,148 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:47:43,241 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:43,242 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-28 02:47:43,243 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:43,259 INFO L588 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-11-28 02:47:43,260 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:47:43,260 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2019-11-28 02:47:43,288 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-28 02:47:43,289 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:43,295 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:43,296 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:47:43,297 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2019-11-28 02:47:43,328 INFO L343 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2019-11-28 02:47:43,329 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 31 treesize of output 26 [2019-11-28 02:47:43,329 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:43,338 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:43,338 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:47:43,339 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2019-11-28 02:47:43,392 INFO L343 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-28 02:47:43,393 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 16 [2019-11-28 02:47:43,394 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:43,402 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:43,403 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 02:47:43,403 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:15 [2019-11-28 02:47:43,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:47:43,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:47:43,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2019-11-28 02:47:43,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004083007] [2019-11-28 02:47:43,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 02:47:43,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:43,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 02:47:43,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-11-28 02:47:43,458 INFO L87 Difference]: Start difference. First operand 113 states and 127 transitions. Second operand 14 states. [2019-11-28 02:47:44,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:44,170 INFO L93 Difference]: Finished difference Result 161 states and 176 transitions. [2019-11-28 02:47:44,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 02:47:44,171 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2019-11-28 02:47:44,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:44,173 INFO L225 Difference]: With dead ends: 161 [2019-11-28 02:47:44,173 INFO L226 Difference]: Without dead ends: 161 [2019-11-28 02:47:44,173 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2019-11-28 02:47:44,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-11-28 02:47:44,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 119. [2019-11-28 02:47:44,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-11-28 02:47:44,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 135 transitions. [2019-11-28 02:47:44,178 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 135 transitions. Word has length 24 [2019-11-28 02:47:44,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:44,178 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 135 transitions. [2019-11-28 02:47:44,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 02:47:44,178 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 135 transitions. [2019-11-28 02:47:44,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 02:47:44,179 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:44,179 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:44,382 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:47:44,388 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_LEAK, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-11-28 02:47:44,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:44,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1393880154, now seen corresponding path program 1 times [2019-11-28 02:47:44,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:44,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651121952] [2019-11-28 02:47:44,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:44,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:44,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:44,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:47:44,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651121952] [2019-11-28 02:47:44,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823454905] [2019-11-28 02:47:44,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:47:44,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:44,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-28 02:47:44,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:47:44,709 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:44,710 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-28 02:47:44,711 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:44,720 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:44,726 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-28 02:47:44,727 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:44,735 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:44,736 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:47:44,736 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-11-28 02:47:44,766 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-28 02:47:44,766 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:44,780 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:44,786 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-28 02:47:44,787 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:44,805 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:44,807 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:47:44,807 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:38 [2019-11-28 02:47:44,856 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:47:44,857 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2019-11-28 02:47:44,858 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:44,871 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:44,876 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:47:44,877 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-11-28 02:47:44,878 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:44,891 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:44,891 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:47:44,892 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:64, output treesize:56 [2019-11-28 02:47:44,972 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:47:44,973 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 40 treesize of output 22 [2019-11-28 02:47:44,974 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:44,992 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:45,036 INFO L343 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-28 02:47:45,036 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 37 treesize of output 19 [2019-11-28 02:47:45,037 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:45,049 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:45,050 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 02:47:45,050 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:70, output treesize:22 [2019-11-28 02:47:45,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:47:45,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:47:45,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2019-11-28 02:47:45,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695507336] [2019-11-28 02:47:45,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-28 02:47:45,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:45,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-28 02:47:45,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2019-11-28 02:47:45,113 INFO L87 Difference]: Start difference. First operand 119 states and 135 transitions. Second operand 17 states. [2019-11-28 02:47:45,925 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 53 [2019-11-28 02:47:46,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:46,844 INFO L93 Difference]: Finished difference Result 179 states and 195 transitions. [2019-11-28 02:47:46,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 02:47:46,844 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 24 [2019-11-28 02:47:46,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:46,848 INFO L225 Difference]: With dead ends: 179 [2019-11-28 02:47:46,849 INFO L226 Difference]: Without dead ends: 179 [2019-11-28 02:47:46,849 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=155, Invalid=601, Unknown=0, NotChecked=0, Total=756 [2019-11-28 02:47:46,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-11-28 02:47:46,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 118. [2019-11-28 02:47:46,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-11-28 02:47:46,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 133 transitions. [2019-11-28 02:47:46,854 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 133 transitions. Word has length 24 [2019-11-28 02:47:46,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:46,855 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 133 transitions. [2019-11-28 02:47:46,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-28 02:47:46,855 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 133 transitions. [2019-11-28 02:47:46,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 02:47:46,856 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:46,856 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:47,060 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:47:47,061 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_LEAK, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-11-28 02:47:47,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:47,062 INFO L82 PathProgramCache]: Analyzing trace with hash 258980964, now seen corresponding path program 1 times [2019-11-28 02:47:47,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:47,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011191695] [2019-11-28 02:47:47,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:47,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:47,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:47,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:47:47,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011191695] [2019-11-28 02:47:47,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:47,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 02:47:47,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98599758] [2019-11-28 02:47:47,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 02:47:47,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:47,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 02:47:47,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:47:47,153 INFO L87 Difference]: Start difference. First operand 118 states and 133 transitions. Second operand 8 states. [2019-11-28 02:47:47,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:47,655 INFO L93 Difference]: Finished difference Result 163 states and 180 transitions. [2019-11-28 02:47:47,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 02:47:47,656 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-11-28 02:47:47,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:47,657 INFO L225 Difference]: With dead ends: 163 [2019-11-28 02:47:47,658 INFO L226 Difference]: Without dead ends: 163 [2019-11-28 02:47:47,658 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-11-28 02:47:47,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-28 02:47:47,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 122. [2019-11-28 02:47:47,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-28 02:47:47,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 139 transitions. [2019-11-28 02:47:47,662 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 139 transitions. Word has length 25 [2019-11-28 02:47:47,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:47,663 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 139 transitions. [2019-11-28 02:47:47,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 02:47:47,663 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 139 transitions. [2019-11-28 02:47:47,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 02:47:47,664 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:47,664 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:47,664 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_LEAK, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-11-28 02:47:47,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:47,665 INFO L82 PathProgramCache]: Analyzing trace with hash 258980965, now seen corresponding path program 1 times [2019-11-28 02:47:47,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:47,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053746870] [2019-11-28 02:47:47,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:47,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:47,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:47,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:47:47,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053746870] [2019-11-28 02:47:47,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:47,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 02:47:47,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250486419] [2019-11-28 02:47:47,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 02:47:47,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:47,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 02:47:47,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:47:47,801 INFO L87 Difference]: Start difference. First operand 122 states and 139 transitions. Second operand 9 states. [2019-11-28 02:47:48,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:48,549 INFO L93 Difference]: Finished difference Result 185 states and 202 transitions. [2019-11-28 02:47:48,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 02:47:48,549 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-11-28 02:47:48,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:48,551 INFO L225 Difference]: With dead ends: 185 [2019-11-28 02:47:48,551 INFO L226 Difference]: Without dead ends: 185 [2019-11-28 02:47:48,552 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-11-28 02:47:48,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-28 02:47:48,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 124. [2019-11-28 02:47:48,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-28 02:47:48,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 141 transitions. [2019-11-28 02:47:48,556 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 141 transitions. Word has length 25 [2019-11-28 02:47:48,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:48,557 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 141 transitions. [2019-11-28 02:47:48,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 02:47:48,557 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 141 transitions. [2019-11-28 02:47:48,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 02:47:48,558 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:48,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, 1, 1, 1, 1, 1] [2019-11-28 02:47:48,559 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_LEAK, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-11-28 02:47:48,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:48,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1052847383, now seen corresponding path program 1 times [2019-11-28 02:47:48,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:48,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279350960] [2019-11-28 02:47:48,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:48,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:48,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:48,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:48,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279350960] [2019-11-28 02:47:48,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:48,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 02:47:48,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774342392] [2019-11-28 02:47:48,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:47:48,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:48,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:47:48,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:47:48,625 INFO L87 Difference]: Start difference. First operand 124 states and 141 transitions. Second operand 7 states. [2019-11-28 02:47:49,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:49,015 INFO L93 Difference]: Finished difference Result 187 states and 209 transitions. [2019-11-28 02:47:49,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 02:47:49,015 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-11-28 02:47:49,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:49,017 INFO L225 Difference]: With dead ends: 187 [2019-11-28 02:47:49,017 INFO L226 Difference]: Without dead ends: 187 [2019-11-28 02:47:49,018 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:47:49,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-11-28 02:47:49,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 136. [2019-11-28 02:47:49,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-11-28 02:47:49,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 156 transitions. [2019-11-28 02:47:49,023 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 156 transitions. Word has length 25 [2019-11-28 02:47:49,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:49,024 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 156 transitions. [2019-11-28 02:47:49,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:47:49,024 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 156 transitions. [2019-11-28 02:47:49,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 02:47:49,025 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:49,025 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:49,026 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_LEAK, mainErr53REQUIRES_VIOLATION, mainErr60ENSURES_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-11-28 02:47:49,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:49,026 INFO L82 PathProgramCache]: Analyzing trace with hash -227392695, now seen corresponding path program 1 times [2019-11-28 02:47:49,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:49,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517714131] [2019-11-28 02:47:49,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:49,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:47:49,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:47:49,095 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:47:49,095 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 02:47:49,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:47:49 BoogieIcfgContainer [2019-11-28 02:47:49,138 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 02:47:49,139 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 02:47:49,139 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 02:47:49,139 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 02:47:49,140 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:35" (3/4) ... [2019-11-28 02:47:49,142 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 02:47:49,192 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 02:47:49,192 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 02:47:49,194 INFO L168 Benchmark]: Toolchain (without parser) took 15391.02 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 366.0 MB). Free memory was 957.7 MB in the beginning and 1.3 GB in the end (delta: -357.4 MB). Peak memory consumption was 8.5 MB. Max. memory is 11.5 GB. [2019-11-28 02:47:49,194 INFO L168 Benchmark]: CDTParser took 0.26 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:47:49,195 INFO L168 Benchmark]: CACSL2BoogieTranslator took 637.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -172.7 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-28 02:47:49,195 INFO L168 Benchmark]: Boogie Preprocessor took 74.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:47:49,196 INFO L168 Benchmark]: RCFGBuilder took 861.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 64.5 MB). Peak memory consumption was 64.5 MB. Max. memory is 11.5 GB. [2019-11-28 02:47:49,196 INFO L168 Benchmark]: TraceAbstraction took 13759.88 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 222.3 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -261.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:47:49,197 INFO L168 Benchmark]: Witness Printer took 53.53 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:47:49,199 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.26 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 637.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -172.7 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 74.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 861.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 64.5 MB). Peak memory consumption was 64.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13759.88 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 222.3 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -261.3 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 53.53 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1052]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L989] SLL* head = malloc(sizeof(SLL)); VAL [head={6:0}, malloc(sizeof(SLL))={6:0}] [L990] head->next = ((void*)0) VAL [head={6:0}, malloc(sizeof(SLL))={6:0}] [L991] head->prev = ((void*)0) VAL [head={6:0}, malloc(sizeof(SLL))={6:0}] [L992] head->data = 0 VAL [head={6:0}, malloc(sizeof(SLL))={6:0}] [L994] SLL* x = head; VAL [head={6:0}, malloc(sizeof(SLL))={6:0}, x={6:0}] [L997] COND FALSE !(__VERIFIER_nondet_int()) [L1008] COND TRUE __VERIFIER_nondet_int() [L1009] x = malloc(sizeof(SLL)) VAL [head={6:0}, malloc(sizeof(SLL))={6:0}, malloc(sizeof(SLL))={5:0}, x={5:0}] [L1010] x->data = 1 VAL [head={6:0}, malloc(sizeof(SLL))={6:0}, malloc(sizeof(SLL))={5:0}, x={5:0}] [L1011] x->next = head VAL [head={6:0}, malloc(sizeof(SLL))={6:0}, malloc(sizeof(SLL))={5:0}, x={5:0}] [L1012] x->prev = ((void*)0) VAL [head={6:0}, malloc(sizeof(SLL))={6:0}, malloc(sizeof(SLL))={5:0}, x={5:0}] [L1013] head = x VAL [head={5:0}, malloc(sizeof(SLL))={6:0}, malloc(sizeof(SLL))={5:0}, x={5:0}] [L1039] x = head VAL [head={5:0}, malloc(sizeof(SLL))={6:0}, malloc(sizeof(SLL))={5:0}, x={5:0}] [L1042] EXPR x->data VAL [head={5:0}, malloc(sizeof(SLL))={6:0}, malloc(sizeof(SLL))={5:0}, x={5:0}, x->data=1] [L1042] COND FALSE !(x->data != 1) [L1048] EXPR x->next VAL [head={5:0}, malloc(sizeof(SLL))={6:0}, malloc(sizeof(SLL))={5:0}, x={5:0}, x->next={6:0}] [L1048] x = x->next [L1049] COND TRUE \read(*x) VAL [head={5:0}, malloc(sizeof(SLL))={6:0}, malloc(sizeof(SLL))={5:0}, x={6:0}] [L1051] EXPR x->data VAL [head={5:0}, malloc(sizeof(SLL))={6:0}, malloc(sizeof(SLL))={5:0}, x={6:0}, x->data=0] [L1051] COND TRUE x->data != 1 [L1052] __VERIFIER_error() VAL [head={5:0}, malloc(sizeof(SLL))={6:0}, malloc(sizeof(SLL))={5:0}, x={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 130 locations, 61 error locations. Result: UNSAFE, OverallTime: 13.6s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 9.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1219 SDtfs, 2674 SDslu, 2471 SDs, 0 SdLazy, 7033 SolverSat, 421 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 247 GetRequests, 77 SyntacticMatches, 10 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=136occurred in iteration=16, 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, 16 MinimizatonAttempts, 620 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 370 NumberOfCodeBlocks, 370 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 325 ConstructedInterpolants, 4 QuantifiedInterpolants, 57540 SizeOfPredicates, 20 NumberOfNonLiveVariables, 274 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 18 InterpolantComputations, 14 PerfectInterpolantSequences, 1/5 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...