./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/forester-heap/dll-circular-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/dll-circular-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 95b20088216028e3d05e3cb41d4ed5c20af6a751 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup) --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 20:20:00,441 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:20:00,444 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:20:00,463 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:20:00,463 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:20:00,466 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:20:00,468 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:20:00,481 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:20:00,484 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:20:00,487 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:20:00,489 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:20:00,492 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:20:00,492 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:20:00,496 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:20:00,498 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:20:00,499 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:20:00,500 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:20:00,501 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:20:00,503 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:20:00,505 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:20:00,507 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:20:00,508 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:20:00,509 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:20:00,510 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:20:00,512 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:20:00,512 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:20:00,513 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:20:00,514 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:20:00,514 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:20:00,515 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:20:00,515 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:20:00,516 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:20:00,517 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:20:00,518 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:20:00,519 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:20:00,519 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:20:00,520 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:20:00,520 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:20:00,520 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:20:00,521 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:20:00,522 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:20:00,523 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2019-11-28 20:20:00,537 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:20:00,538 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:20:00,539 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:20:00,539 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:20:00,539 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:20:00,540 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:20:00,540 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 20:20:00,540 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:20:00,540 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:20:00,541 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 20:20:00,541 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:20:00,541 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 20:20:00,541 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 20:20:00,541 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 20:20:00,542 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 20:20:00,542 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 20:20:00,542 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:20:00,542 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:20:00,543 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:20:00,543 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 20:20:00,543 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 20:20:00,543 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:20:00,543 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:20:00,544 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 20:20:00,544 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:20:00,544 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 20:20:00,544 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:20:00,544 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 95b20088216028e3d05e3cb41d4ed5c20af6a751 [2019-11-28 20:20:00,835 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:20:00,848 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:20:00,852 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:20:00,854 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:20:00,854 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:20:00,855 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-circular-1.i [2019-11-28 20:20:00,916 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd4bd8d1a/dcc37dc3415f41d38dd7eb35eb446b2c/FLAG6fa5dcdcb [2019-11-28 20:20:01,456 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:20:01,457 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-1.i [2019-11-28 20:20:01,477 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd4bd8d1a/dcc37dc3415f41d38dd7eb35eb446b2c/FLAG6fa5dcdcb [2019-11-28 20:20:01,758 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd4bd8d1a/dcc37dc3415f41d38dd7eb35eb446b2c [2019-11-28 20:20:01,762 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:20:01,763 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 20:20:01,764 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:20:01,765 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:20:01,768 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:20:01,769 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:20:01" (1/1) ... [2019-11-28 20:20:01,772 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@564c4a0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:01, skipping insertion in model container [2019-11-28 20:20:01,772 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:20:01" (1/1) ... [2019-11-28 20:20:01,781 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:20:01,821 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:20:02,259 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:20:02,274 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:20:02,349 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:20:02,401 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:20:02,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:02 WrapperNode [2019-11-28 20:20:02,402 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:20:02,403 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:20:02,403 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:20:02,403 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:20:02,420 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:02" (1/1) ... [2019-11-28 20:20:02,420 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:02" (1/1) ... [2019-11-28 20:20:02,437 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:02" (1/1) ... [2019-11-28 20:20:02,437 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:02" (1/1) ... [2019-11-28 20:20:02,457 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:02" (1/1) ... [2019-11-28 20:20:02,463 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:02" (1/1) ... [2019-11-28 20:20:02,467 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:02" (1/1) ... [2019-11-28 20:20:02,473 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:20:02,474 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:20:02,474 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:20:02,474 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:20:02,475 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:02" (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 20:20:02,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 20:20:02,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:20:02,539 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 20:20:02,539 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-28 20:20:02,540 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-28 20:20:02,541 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-28 20:20:02,541 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-28 20:20:02,542 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-28 20:20:02,542 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-28 20:20:02,542 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-28 20:20:02,542 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-28 20:20:02,543 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-28 20:20:02,544 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-28 20:20:02,544 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-28 20:20:02,544 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-28 20:20:02,544 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-28 20:20:02,544 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-28 20:20:02,547 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-28 20:20:02,547 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-28 20:20:02,547 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-28 20:20:02,547 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-28 20:20:02,547 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-28 20:20:02,548 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-28 20:20:02,548 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-28 20:20:02,548 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-28 20:20:02,549 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-28 20:20:02,549 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-28 20:20:02,549 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-28 20:20:02,549 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-28 20:20:02,550 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-28 20:20:02,550 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-28 20:20:02,550 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-28 20:20:02,550 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-28 20:20:02,550 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-28 20:20:02,551 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-28 20:20:02,551 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-28 20:20:02,551 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-28 20:20:02,551 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-28 20:20:02,552 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-28 20:20:02,552 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-28 20:20:02,552 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-28 20:20:02,552 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-28 20:20:02,552 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-28 20:20:02,552 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-28 20:20:02,552 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-28 20:20:02,554 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-28 20:20:02,554 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-28 20:20:02,554 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-28 20:20:02,555 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-28 20:20:02,555 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-28 20:20:02,555 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-28 20:20:02,555 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-28 20:20:02,555 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-28 20:20:02,555 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-28 20:20:02,556 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-28 20:20:02,556 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-28 20:20:02,556 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-28 20:20:02,556 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-28 20:20:02,556 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-28 20:20:02,557 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-28 20:20:02,557 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-28 20:20:02,557 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-28 20:20:02,557 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-28 20:20:02,557 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-28 20:20:02,557 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-28 20:20:02,557 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-28 20:20:02,558 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-28 20:20:02,558 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-28 20:20:02,558 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-28 20:20:02,559 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-28 20:20:02,559 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-28 20:20:02,559 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-28 20:20:02,559 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-28 20:20:02,560 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-28 20:20:02,560 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-28 20:20:02,561 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-28 20:20:02,562 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-28 20:20:02,562 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-28 20:20:02,562 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-28 20:20:02,562 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-28 20:20:02,562 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-28 20:20:02,562 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-28 20:20:02,562 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-28 20:20:02,563 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-28 20:20:02,563 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-28 20:20:02,563 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-28 20:20:02,563 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-28 20:20:02,563 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-28 20:20:02,563 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-28 20:20:02,563 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-28 20:20:02,564 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-28 20:20:02,564 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-28 20:20:02,564 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-28 20:20:02,564 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-28 20:20:02,564 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-28 20:20:02,564 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-28 20:20:02,564 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-28 20:20:02,565 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-28 20:20:02,565 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-28 20:20:02,565 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-28 20:20:02,565 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-28 20:20:02,565 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-28 20:20:02,565 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-28 20:20:02,565 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-28 20:20:02,565 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-28 20:20:02,566 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-28 20:20:02,566 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-28 20:20:02,566 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-28 20:20:02,566 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 20:20:02,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 20:20:02,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 20:20:02,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 20:20:02,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 20:20:02,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 20:20:02,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 20:20:02,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 20:20:02,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:20:03,265 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:20:03,265 INFO L287 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-28 20:20:03,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:20:03 BoogieIcfgContainer [2019-11-28 20:20:03,268 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:20:03,270 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 20:20:03,270 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 20:20:03,274 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 20:20:03,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:20:01" (1/3) ... [2019-11-28 20:20:03,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bbc67fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:20:03, skipping insertion in model container [2019-11-28 20:20:03,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:02" (2/3) ... [2019-11-28 20:20:03,277 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bbc67fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:20:03, skipping insertion in model container [2019-11-28 20:20:03,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:20:03" (3/3) ... [2019-11-28 20:20:03,279 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-circular-1.i [2019-11-28 20:20:03,290 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 20:20:03,304 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 50 error locations. [2019-11-28 20:20:03,319 INFO L249 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2019-11-28 20:20:03,353 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 20:20:03,354 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 20:20:03,354 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 20:20:03,354 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:20:03,354 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:20:03,355 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 20:20:03,355 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:20:03,355 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 20:20:03,380 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2019-11-28 20:20:03,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-28 20:20:03,394 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:03,396 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:03,407 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:03,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:03,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1524629102, now seen corresponding path program 1 times [2019-11-28 20:20:03,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:03,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855982312] [2019-11-28 20:20:03,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:03,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:03,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:03,617 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 20:20:03,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855982312] [2019-11-28 20:20:03,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:03,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:20:03,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18684548] [2019-11-28 20:20:03,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:20:03,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:03,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:20:03,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:20:03,649 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 4 states. [2019-11-28 20:20:03,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:03,993 INFO L93 Difference]: Finished difference Result 119 states and 126 transitions. [2019-11-28 20:20:03,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:20:03,996 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-28 20:20:03,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:04,008 INFO L225 Difference]: With dead ends: 119 [2019-11-28 20:20:04,009 INFO L226 Difference]: Without dead ends: 116 [2019-11-28 20:20:04,011 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 20:20:04,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-28 20:20:04,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 106. [2019-11-28 20:20:04,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-28 20:20:04,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 112 transitions. [2019-11-28 20:20:04,067 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 112 transitions. Word has length 7 [2019-11-28 20:20:04,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:04,068 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 112 transitions. [2019-11-28 20:20:04,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:20:04,068 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 112 transitions. [2019-11-28 20:20:04,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-28 20:20:04,069 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:04,069 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:04,070 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:04,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:04,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1524629103, now seen corresponding path program 1 times [2019-11-28 20:20:04,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:04,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188182341] [2019-11-28 20:20:04,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:04,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:04,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:04,204 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 20:20:04,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188182341] [2019-11-28 20:20:04,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:04,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:20:04,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145670299] [2019-11-28 20:20:04,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:20:04,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:04,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:20:04,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:20:04,208 INFO L87 Difference]: Start difference. First operand 106 states and 112 transitions. Second operand 4 states. [2019-11-28 20:20:04,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:04,456 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2019-11-28 20:20:04,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:20:04,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-28 20:20:04,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:04,459 INFO L225 Difference]: With dead ends: 114 [2019-11-28 20:20:04,459 INFO L226 Difference]: Without dead ends: 114 [2019-11-28 20:20:04,460 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 20:20:04,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-28 20:20:04,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 102. [2019-11-28 20:20:04,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-28 20:20:04,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2019-11-28 20:20:04,471 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 7 [2019-11-28 20:20:04,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:04,473 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2019-11-28 20:20:04,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:20:04,473 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2019-11-28 20:20:04,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 20:20:04,474 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:04,474 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:04,474 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:04,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:04,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1043867395, now seen corresponding path program 1 times [2019-11-28 20:20:04,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:04,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105318376] [2019-11-28 20:20:04,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:04,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:04,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:04,571 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 20:20:04,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105318376] [2019-11-28 20:20:04,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:04,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:20:04,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116363140] [2019-11-28 20:20:04,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:20:04,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:04,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:20:04,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:20:04,574 INFO L87 Difference]: Start difference. First operand 102 states and 108 transitions. Second operand 5 states. [2019-11-28 20:20:04,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:04,856 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2019-11-28 20:20:04,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:20:04,858 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-28 20:20:04,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:04,860 INFO L225 Difference]: With dead ends: 99 [2019-11-28 20:20:04,860 INFO L226 Difference]: Without dead ends: 99 [2019-11-28 20:20:04,862 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 20:20:04,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-28 20:20:04,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 90. [2019-11-28 20:20:04,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-28 20:20:04,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2019-11-28 20:20:04,878 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 12 [2019-11-28 20:20:04,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:04,879 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2019-11-28 20:20:04,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:20:04,879 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2019-11-28 20:20:04,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 20:20:04,880 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:04,880 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:04,881 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:04,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:04,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1043867394, now seen corresponding path program 1 times [2019-11-28 20:20:04,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:04,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639089730] [2019-11-28 20:20:04,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:04,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:04,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:05,007 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 20:20:05,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639089730] [2019-11-28 20:20:05,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:05,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:20:05,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775619288] [2019-11-28 20:20:05,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:20:05,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:05,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:20:05,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:20:05,015 INFO L87 Difference]: Start difference. First operand 90 states and 96 transitions. Second operand 5 states. [2019-11-28 20:20:05,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:05,295 INFO L93 Difference]: Finished difference Result 114 states and 121 transitions. [2019-11-28 20:20:05,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:20:05,296 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-28 20:20:05,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:05,299 INFO L225 Difference]: With dead ends: 114 [2019-11-28 20:20:05,299 INFO L226 Difference]: Without dead ends: 114 [2019-11-28 20:20:05,299 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:20:05,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-28 20:20:05,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 98. [2019-11-28 20:20:05,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-28 20:20:05,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2019-11-28 20:20:05,308 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 12 [2019-11-28 20:20:05,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:05,308 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2019-11-28 20:20:05,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:20:05,308 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2019-11-28 20:20:05,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 20:20:05,309 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:05,309 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:05,310 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:05,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:05,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1865783331, now seen corresponding path program 1 times [2019-11-28 20:20:05,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:05,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901872870] [2019-11-28 20:20:05,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:05,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:05,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:05,410 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 20:20:05,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901872870] [2019-11-28 20:20:05,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:05,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 20:20:05,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960200801] [2019-11-28 20:20:05,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:20:05,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:05,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:20:05,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:20:05,414 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand 6 states. [2019-11-28 20:20:05,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:05,806 INFO L93 Difference]: Finished difference Result 148 states and 159 transitions. [2019-11-28 20:20:05,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:20:05,806 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-11-28 20:20:05,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:05,809 INFO L225 Difference]: With dead ends: 148 [2019-11-28 20:20:05,809 INFO L226 Difference]: Without dead ends: 148 [2019-11-28 20:20:05,810 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 20:20:05,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-11-28 20:20:05,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 97. [2019-11-28 20:20:05,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-28 20:20:05,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2019-11-28 20:20:05,819 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 14 [2019-11-28 20:20:05,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:05,819 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2019-11-28 20:20:05,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:20:05,820 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2019-11-28 20:20:05,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 20:20:05,820 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:05,820 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:05,821 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:05,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:05,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1865783332, now seen corresponding path program 1 times [2019-11-28 20:20:05,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:05,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134555455] [2019-11-28 20:20:05,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:05,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:05,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:05,895 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 20:20:05,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134555455] [2019-11-28 20:20:05,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:05,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 20:20:05,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618177958] [2019-11-28 20:20:05,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:20:05,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:05,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:20:05,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:20:05,897 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand 6 states. [2019-11-28 20:20:06,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:06,397 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions. [2019-11-28 20:20:06,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 20:20:06,397 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-11-28 20:20:06,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:06,398 INFO L225 Difference]: With dead ends: 149 [2019-11-28 20:20:06,398 INFO L226 Difference]: Without dead ends: 149 [2019-11-28 20:20:06,399 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 20:20:06,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-28 20:20:06,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 96. [2019-11-28 20:20:06,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-28 20:20:06,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2019-11-28 20:20:06,406 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 14 [2019-11-28 20:20:06,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:06,406 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2019-11-28 20:20:06,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:20:06,407 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2019-11-28 20:20:06,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 20:20:06,407 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:06,407 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:06,408 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:06,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:06,408 INFO L82 PathProgramCache]: Analyzing trace with hash 2015464416, now seen corresponding path program 1 times [2019-11-28 20:20:06,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:06,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430233203] [2019-11-28 20:20:06,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:06,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:06,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:06,606 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 20:20:06,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430233203] [2019-11-28 20:20:06,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:06,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 20:20:06,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219127214] [2019-11-28 20:20:06,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 20:20:06,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:06,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 20:20:06,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:20:06,609 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand 9 states. [2019-11-28 20:20:07,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:07,083 INFO L93 Difference]: Finished difference Result 179 states and 190 transitions. [2019-11-28 20:20:07,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 20:20:07,083 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-11-28 20:20:07,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:07,085 INFO L225 Difference]: With dead ends: 179 [2019-11-28 20:20:07,085 INFO L226 Difference]: Without dead ends: 179 [2019-11-28 20:20:07,085 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-11-28 20:20:07,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-11-28 20:20:07,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 99. [2019-11-28 20:20:07,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-28 20:20:07,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2019-11-28 20:20:07,092 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 16 [2019-11-28 20:20:07,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:07,092 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2019-11-28 20:20:07,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 20:20:07,092 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2019-11-28 20:20:07,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 20:20:07,093 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:07,093 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:07,093 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:07,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:07,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1945108375, now seen corresponding path program 1 times [2019-11-28 20:20:07,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:07,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188510895] [2019-11-28 20:20:07,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:07,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:07,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:07,208 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 20:20:07,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188510895] [2019-11-28 20:20:07,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:07,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 20:20:07,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127705968] [2019-11-28 20:20:07,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 20:20:07,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:07,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 20:20:07,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:20:07,210 INFO L87 Difference]: Start difference. First operand 99 states and 106 transitions. Second operand 9 states. [2019-11-28 20:20:07,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:07,732 INFO L93 Difference]: Finished difference Result 141 states and 150 transitions. [2019-11-28 20:20:07,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 20:20:07,733 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2019-11-28 20:20:07,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:07,734 INFO L225 Difference]: With dead ends: 141 [2019-11-28 20:20:07,734 INFO L226 Difference]: Without dead ends: 141 [2019-11-28 20:20:07,735 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-11-28 20:20:07,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-11-28 20:20:07,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 101. [2019-11-28 20:20:07,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-28 20:20:07,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2019-11-28 20:20:07,741 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 17 [2019-11-28 20:20:07,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:07,741 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2019-11-28 20:20:07,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 20:20:07,741 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2019-11-28 20:20:07,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 20:20:07,742 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:07,742 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:07,743 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:07,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:07,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1945108374, now seen corresponding path program 1 times [2019-11-28 20:20:07,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:07,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312713410] [2019-11-28 20:20:07,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:07,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:07,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:07,932 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 20:20:07,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312713410] [2019-11-28 20:20:07,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:07,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 20:20:07,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128354148] [2019-11-28 20:20:07,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 20:20:07,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:07,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 20:20:07,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:20:07,936 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand 9 states. [2019-11-28 20:20:08,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:08,537 INFO L93 Difference]: Finished difference Result 173 states and 184 transitions. [2019-11-28 20:20:08,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 20:20:08,538 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2019-11-28 20:20:08,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:08,539 INFO L225 Difference]: With dead ends: 173 [2019-11-28 20:20:08,539 INFO L226 Difference]: Without dead ends: 173 [2019-11-28 20:20:08,540 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-11-28 20:20:08,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-11-28 20:20:08,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 113. [2019-11-28 20:20:08,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-28 20:20:08,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 127 transitions. [2019-11-28 20:20:08,550 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 127 transitions. Word has length 17 [2019-11-28 20:20:08,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:08,556 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 127 transitions. [2019-11-28 20:20:08,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 20:20:08,556 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2019-11-28 20:20:08,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 20:20:08,557 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:08,557 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:08,557 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:08,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:08,557 INFO L82 PathProgramCache]: Analyzing trace with hash 748051109, now seen corresponding path program 1 times [2019-11-28 20:20:08,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:08,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185923386] [2019-11-28 20:20:08,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:08,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:08,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:08,707 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 20:20:08,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185923386] [2019-11-28 20:20:08,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:08,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 20:20:08,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941206690] [2019-11-28 20:20:08,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 20:20:08,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:08,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 20:20:08,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:20:08,710 INFO L87 Difference]: Start difference. First operand 113 states and 127 transitions. Second operand 10 states. [2019-11-28 20:20:09,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:09,299 INFO L93 Difference]: Finished difference Result 121 states and 136 transitions. [2019-11-28 20:20:09,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 20:20:09,301 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-11-28 20:20:09,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:09,301 INFO L225 Difference]: With dead ends: 121 [2019-11-28 20:20:09,302 INFO L226 Difference]: Without dead ends: 121 [2019-11-28 20:20:09,302 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-11-28 20:20:09,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-11-28 20:20:09,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 112. [2019-11-28 20:20:09,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-28 20:20:09,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 126 transitions. [2019-11-28 20:20:09,307 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 126 transitions. Word has length 18 [2019-11-28 20:20:09,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:09,307 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 126 transitions. [2019-11-28 20:20:09,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 20:20:09,307 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 126 transitions. [2019-11-28 20:20:09,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 20:20:09,308 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:09,308 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:09,309 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:09,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:09,309 INFO L82 PathProgramCache]: Analyzing trace with hash 748051110, now seen corresponding path program 1 times [2019-11-28 20:20:09,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:09,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421542430] [2019-11-28 20:20:09,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:09,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:09,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:09,456 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 20:20:09,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421542430] [2019-11-28 20:20:09,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:09,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-28 20:20:09,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991949545] [2019-11-28 20:20:09,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 20:20:09,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:09,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 20:20:09,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-28 20:20:09,460 INFO L87 Difference]: Start difference. First operand 112 states and 126 transitions. Second operand 11 states. [2019-11-28 20:20:10,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:10,332 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2019-11-28 20:20:10,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 20:20:10,332 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2019-11-28 20:20:10,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:10,334 INFO L225 Difference]: With dead ends: 116 [2019-11-28 20:20:10,334 INFO L226 Difference]: Without dead ends: 116 [2019-11-28 20:20:10,334 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-11-28 20:20:10,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-28 20:20:10,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 101. [2019-11-28 20:20:10,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-28 20:20:10,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 115 transitions. [2019-11-28 20:20:10,338 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 115 transitions. Word has length 18 [2019-11-28 20:20:10,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:10,339 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 115 transitions. [2019-11-28 20:20:10,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 20:20:10,339 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 115 transitions. [2019-11-28 20:20:10,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 20:20:10,340 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:10,340 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 20:20:10,340 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:10,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:10,341 INFO L82 PathProgramCache]: Analyzing trace with hash 975241550, now seen corresponding path program 1 times [2019-11-28 20:20:10,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:10,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875855944] [2019-11-28 20:20:10,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:10,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:10,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:10,475 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 20:20:10,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875855944] [2019-11-28 20:20:10,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:10,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 20:20:10,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455990766] [2019-11-28 20:20:10,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 20:20:10,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:10,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 20:20:10,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:20:10,477 INFO L87 Difference]: Start difference. First operand 101 states and 115 transitions. Second operand 10 states. [2019-11-28 20:20:11,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:11,060 INFO L93 Difference]: Finished difference Result 149 states and 160 transitions. [2019-11-28 20:20:11,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 20:20:11,061 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-28 20:20:11,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:11,063 INFO L225 Difference]: With dead ends: 149 [2019-11-28 20:20:11,063 INFO L226 Difference]: Without dead ends: 149 [2019-11-28 20:20:11,063 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-11-28 20:20:11,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-28 20:20:11,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 101. [2019-11-28 20:20:11,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-28 20:20:11,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2019-11-28 20:20:11,068 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 20 [2019-11-28 20:20:11,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:11,069 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2019-11-28 20:20:11,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 20:20:11,069 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2019-11-28 20:20:11,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 20:20:11,074 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:11,074 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 20:20:11,075 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:11,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:11,075 INFO L82 PathProgramCache]: Analyzing trace with hash 975241551, now seen corresponding path program 1 times [2019-11-28 20:20:11,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:11,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508309021] [2019-11-28 20:20:11,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:11,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:11,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:11,245 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 20:20:11,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508309021] [2019-11-28 20:20:11,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:11,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 20:20:11,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521838893] [2019-11-28 20:20:11,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 20:20:11,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:11,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 20:20:11,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:20:11,247 INFO L87 Difference]: Start difference. First operand 101 states and 114 transitions. Second operand 9 states. [2019-11-28 20:20:11,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:11,726 INFO L93 Difference]: Finished difference Result 159 states and 170 transitions. [2019-11-28 20:20:11,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 20:20:11,727 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-11-28 20:20:11,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:11,729 INFO L225 Difference]: With dead ends: 159 [2019-11-28 20:20:11,729 INFO L226 Difference]: Without dead ends: 159 [2019-11-28 20:20:11,730 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-11-28 20:20:11,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-28 20:20:11,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 101. [2019-11-28 20:20:11,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-28 20:20:11,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2019-11-28 20:20:11,734 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 20 [2019-11-28 20:20:11,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:11,734 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2019-11-28 20:20:11,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 20:20:11,735 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2019-11-28 20:20:11,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 20:20:11,735 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:11,735 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:11,736 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:11,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:11,736 INFO L82 PathProgramCache]: Analyzing trace with hash 167702177, now seen corresponding path program 1 times [2019-11-28 20:20:11,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:11,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530547133] [2019-11-28 20:20:11,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:11,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:11,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:11,809 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 20:20:11,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530547133] [2019-11-28 20:20:11,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:11,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 20:20:11,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527380882] [2019-11-28 20:20:11,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 20:20:11,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:11,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 20:20:11,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:20:11,811 INFO L87 Difference]: Start difference. First operand 101 states and 113 transitions. Second operand 8 states. [2019-11-28 20:20:12,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:12,203 INFO L93 Difference]: Finished difference Result 138 states and 153 transitions. [2019-11-28 20:20:12,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 20:20:12,203 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-11-28 20:20:12,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:12,205 INFO L225 Difference]: With dead ends: 138 [2019-11-28 20:20:12,205 INFO L226 Difference]: Without dead ends: 138 [2019-11-28 20:20:12,206 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-11-28 20:20:12,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-11-28 20:20:12,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 102. [2019-11-28 20:20:12,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-28 20:20:12,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2019-11-28 20:20:12,209 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 21 [2019-11-28 20:20:12,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:12,210 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 115 transitions. [2019-11-28 20:20:12,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 20:20:12,210 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2019-11-28 20:20:12,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 20:20:12,211 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:12,211 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:12,211 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:12,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:12,211 INFO L82 PathProgramCache]: Analyzing trace with hash 167702178, now seen corresponding path program 1 times [2019-11-28 20:20:12,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:12,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653044713] [2019-11-28 20:20:12,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:12,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:12,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:12,415 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 20:20:12,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653044713] [2019-11-28 20:20:12,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:12,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-28 20:20:12,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980125226] [2019-11-28 20:20:12,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 20:20:12,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:12,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 20:20:12,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-28 20:20:12,417 INFO L87 Difference]: Start difference. First operand 102 states and 115 transitions. Second operand 12 states. [2019-11-28 20:20:13,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:13,126 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2019-11-28 20:20:13,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 20:20:13,127 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-11-28 20:20:13,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:13,129 INFO L225 Difference]: With dead ends: 149 [2019-11-28 20:20:13,129 INFO L226 Difference]: Without dead ends: 149 [2019-11-28 20:20:13,130 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2019-11-28 20:20:13,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-28 20:20:13,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 121. [2019-11-28 20:20:13,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-28 20:20:13,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 148 transitions. [2019-11-28 20:20:13,134 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 148 transitions. Word has length 21 [2019-11-28 20:20:13,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:13,134 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 148 transitions. [2019-11-28 20:20:13,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 20:20:13,134 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 148 transitions. [2019-11-28 20:20:13,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 20:20:13,135 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:13,135 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:13,135 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:13,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:13,136 INFO L82 PathProgramCache]: Analyzing trace with hash -2046960464, now seen corresponding path program 1 times [2019-11-28 20:20:13,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:13,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832086982] [2019-11-28 20:20:13,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:13,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:13,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:13,415 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 20:20:13,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832086982] [2019-11-28 20:20:13,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:13,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-28 20:20:13,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129445488] [2019-11-28 20:20:13,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 20:20:13,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:13,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 20:20:13,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-11-28 20:20:13,417 INFO L87 Difference]: Start difference. First operand 121 states and 148 transitions. Second operand 13 states. [2019-11-28 20:20:14,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:14,127 INFO L93 Difference]: Finished difference Result 162 states and 173 transitions. [2019-11-28 20:20:14,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 20:20:14,127 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-11-28 20:20:14,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:14,128 INFO L225 Difference]: With dead ends: 162 [2019-11-28 20:20:14,129 INFO L226 Difference]: Without dead ends: 162 [2019-11-28 20:20:14,129 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2019-11-28 20:20:14,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-11-28 20:20:14,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 122. [2019-11-28 20:20:14,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-28 20:20:14,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 149 transitions. [2019-11-28 20:20:14,133 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 149 transitions. Word has length 23 [2019-11-28 20:20:14,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:14,134 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 149 transitions. [2019-11-28 20:20:14,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 20:20:14,134 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 149 transitions. [2019-11-28 20:20:14,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 20:20:14,134 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:14,135 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:14,135 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:14,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:14,135 INFO L82 PathProgramCache]: Analyzing trace with hash -280035452, now seen corresponding path program 1 times [2019-11-28 20:20:14,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:14,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745053052] [2019-11-28 20:20:14,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:14,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:14,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:14,210 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 20:20:14,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745053052] [2019-11-28 20:20:14,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:14,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 20:20:14,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819566451] [2019-11-28 20:20:14,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 20:20:14,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:14,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 20:20:14,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:20:14,212 INFO L87 Difference]: Start difference. First operand 122 states and 149 transitions. Second operand 8 states. [2019-11-28 20:20:14,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:14,592 INFO L93 Difference]: Finished difference Result 152 states and 168 transitions. [2019-11-28 20:20:14,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 20:20:14,592 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-11-28 20:20:14,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:14,594 INFO L225 Difference]: With dead ends: 152 [2019-11-28 20:20:14,594 INFO L226 Difference]: Without dead ends: 152 [2019-11-28 20:20:14,595 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-11-28 20:20:14,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-28 20:20:14,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 120. [2019-11-28 20:20:14,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-28 20:20:14,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 147 transitions. [2019-11-28 20:20:14,598 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 147 transitions. Word has length 23 [2019-11-28 20:20:14,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:14,598 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 147 transitions. [2019-11-28 20:20:14,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 20:20:14,599 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 147 transitions. [2019-11-28 20:20:14,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 20:20:14,599 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:14,599 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 20:20:14,599 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:14,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:14,600 INFO L82 PathProgramCache]: Analyzing trace with hash 968735281, now seen corresponding path program 1 times [2019-11-28 20:20:14,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:14,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523153561] [2019-11-28 20:20:14,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:14,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:14,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:14,721 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 20:20:14,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523153561] [2019-11-28 20:20:14,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:14,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 20:20:14,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538973068] [2019-11-28 20:20:14,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 20:20:14,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:14,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 20:20:14,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:20:14,723 INFO L87 Difference]: Start difference. First operand 120 states and 147 transitions. Second operand 9 states. [2019-11-28 20:20:15,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:15,119 INFO L93 Difference]: Finished difference Result 152 states and 166 transitions. [2019-11-28 20:20:15,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 20:20:15,120 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2019-11-28 20:20:15,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:15,121 INFO L225 Difference]: With dead ends: 152 [2019-11-28 20:20:15,122 INFO L226 Difference]: Without dead ends: 152 [2019-11-28 20:20:15,122 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-11-28 20:20:15,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-28 20:20:15,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 121. [2019-11-28 20:20:15,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-28 20:20:15,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 148 transitions. [2019-11-28 20:20:15,127 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 148 transitions. Word has length 24 [2019-11-28 20:20:15,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:15,127 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 148 transitions. [2019-11-28 20:20:15,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 20:20:15,127 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 148 transitions. [2019-11-28 20:20:15,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 20:20:15,128 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:15,128 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 20:20:15,128 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:15,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:15,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1412435069, now seen corresponding path program 1 times [2019-11-28 20:20:15,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:15,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386475292] [2019-11-28 20:20:15,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:15,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:15,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:15,378 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 20:20:15,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386475292] [2019-11-28 20:20:15,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:15,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-28 20:20:15,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74956595] [2019-11-28 20:20:15,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 20:20:15,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:15,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 20:20:15,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-11-28 20:20:15,380 INFO L87 Difference]: Start difference. First operand 121 states and 148 transitions. Second operand 13 states. [2019-11-28 20:20:15,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:15,999 INFO L93 Difference]: Finished difference Result 144 states and 155 transitions. [2019-11-28 20:20:16,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 20:20:16,000 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2019-11-28 20:20:16,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:16,001 INFO L225 Difference]: With dead ends: 144 [2019-11-28 20:20:16,002 INFO L226 Difference]: Without dead ends: 144 [2019-11-28 20:20:16,002 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2019-11-28 20:20:16,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-28 20:20:16,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 121. [2019-11-28 20:20:16,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-28 20:20:16,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 147 transitions. [2019-11-28 20:20:16,007 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 147 transitions. Word has length 24 [2019-11-28 20:20:16,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:16,007 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 147 transitions. [2019-11-28 20:20:16,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 20:20:16,007 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 147 transitions. [2019-11-28 20:20:16,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 20:20:16,008 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:16,008 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 20:20:16,008 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:16,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:16,009 INFO L82 PathProgramCache]: Analyzing trace with hash -33931422, now seen corresponding path program 1 times [2019-11-28 20:20:16,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:16,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336250255] [2019-11-28 20:20:16,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:16,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:16,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:16,142 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 20:20:16,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336250255] [2019-11-28 20:20:16,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:16,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 20:20:16,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062796361] [2019-11-28 20:20:16,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 20:20:16,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:16,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 20:20:16,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:20:16,144 INFO L87 Difference]: Start difference. First operand 121 states and 147 transitions. Second operand 9 states. [2019-11-28 20:20:16,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:16,483 INFO L93 Difference]: Finished difference Result 144 states and 158 transitions. [2019-11-28 20:20:16,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 20:20:16,484 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-11-28 20:20:16,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:16,485 INFO L225 Difference]: With dead ends: 144 [2019-11-28 20:20:16,486 INFO L226 Difference]: Without dead ends: 144 [2019-11-28 20:20:16,486 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-11-28 20:20:16,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-28 20:20:16,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 123. [2019-11-28 20:20:16,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-11-28 20:20:16,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 149 transitions. [2019-11-28 20:20:16,490 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 149 transitions. Word has length 25 [2019-11-28 20:20:16,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:16,491 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 149 transitions. [2019-11-28 20:20:16,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 20:20:16,491 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 149 transitions. [2019-11-28 20:20:16,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 20:20:16,491 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:16,491 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 20:20:16,492 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:16,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:16,492 INFO L82 PathProgramCache]: Analyzing trace with hash 835442004, now seen corresponding path program 1 times [2019-11-28 20:20:16,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:16,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168274303] [2019-11-28 20:20:16,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:16,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:16,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:16,535 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 20:20:16,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168274303] [2019-11-28 20:20:16,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:16,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 20:20:16,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548255029] [2019-11-28 20:20:16,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:20:16,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:16,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:20:16,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:20:16,537 INFO L87 Difference]: Start difference. First operand 123 states and 149 transitions. Second operand 6 states. [2019-11-28 20:20:16,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:16,721 INFO L93 Difference]: Finished difference Result 124 states and 150 transitions. [2019-11-28 20:20:16,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 20:20:16,721 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-11-28 20:20:16,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:16,724 INFO L225 Difference]: With dead ends: 124 [2019-11-28 20:20:16,724 INFO L226 Difference]: Without dead ends: 124 [2019-11-28 20:20:16,724 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 20:20:16,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-11-28 20:20:16,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2019-11-28 20:20:16,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-28 20:20:16,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 146 transitions. [2019-11-28 20:20:16,729 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 146 transitions. Word has length 25 [2019-11-28 20:20:16,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:16,729 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 146 transitions. [2019-11-28 20:20:16,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:20:16,730 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 146 transitions. [2019-11-28 20:20:16,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 20:20:16,730 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:16,730 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 20:20:16,731 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:16,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:16,731 INFO L82 PathProgramCache]: Analyzing trace with hash 835442005, now seen corresponding path program 1 times [2019-11-28 20:20:16,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:16,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774934237] [2019-11-28 20:20:16,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:16,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:16,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:16,921 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 20:20:16,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774934237] [2019-11-28 20:20:16,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:16,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-28 20:20:16,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923411096] [2019-11-28 20:20:16,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 20:20:16,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:16,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 20:20:16,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-28 20:20:16,924 INFO L87 Difference]: Start difference. First operand 122 states and 146 transitions. Second operand 11 states. [2019-11-28 20:20:17,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:17,495 INFO L93 Difference]: Finished difference Result 142 states and 153 transitions. [2019-11-28 20:20:17,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 20:20:17,498 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-11-28 20:20:17,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:17,499 INFO L225 Difference]: With dead ends: 142 [2019-11-28 20:20:17,499 INFO L226 Difference]: Without dead ends: 142 [2019-11-28 20:20:17,500 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-11-28 20:20:17,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-28 20:20:17,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 122. [2019-11-28 20:20:17,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-28 20:20:17,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 145 transitions. [2019-11-28 20:20:17,503 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 145 transitions. Word has length 25 [2019-11-28 20:20:17,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:17,503 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 145 transitions. [2019-11-28 20:20:17,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 20:20:17,504 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 145 transitions. [2019-11-28 20:20:17,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 20:20:17,504 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:17,504 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:17,504 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:17,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:17,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1053290924, now seen corresponding path program 1 times [2019-11-28 20:20:17,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:17,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308260865] [2019-11-28 20:20:17,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:17,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:17,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:17,723 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 20:20:17,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308260865] [2019-11-28 20:20:17,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:17,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-28 20:20:17,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568134010] [2019-11-28 20:20:17,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 20:20:17,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:17,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 20:20:17,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:20:17,725 INFO L87 Difference]: Start difference. First operand 122 states and 145 transitions. Second operand 10 states. [2019-11-28 20:20:18,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:18,188 INFO L93 Difference]: Finished difference Result 140 states and 150 transitions. [2019-11-28 20:20:18,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 20:20:18,189 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-11-28 20:20:18,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:18,190 INFO L225 Difference]: With dead ends: 140 [2019-11-28 20:20:18,190 INFO L226 Difference]: Without dead ends: 140 [2019-11-28 20:20:18,191 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-11-28 20:20:18,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-11-28 20:20:18,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 122. [2019-11-28 20:20:18,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-28 20:20:18,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 144 transitions. [2019-11-28 20:20:18,194 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 144 transitions. Word has length 26 [2019-11-28 20:20:18,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:18,194 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 144 transitions. [2019-11-28 20:20:18,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 20:20:18,194 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 144 transitions. [2019-11-28 20:20:18,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 20:20:18,195 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:18,195 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 20:20:18,195 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:18,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:18,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1012463367, now seen corresponding path program 1 times [2019-11-28 20:20:18,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:18,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693973504] [2019-11-28 20:20:18,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:18,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:18,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:18,243 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 20:20:18,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693973504] [2019-11-28 20:20:18,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:18,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:20:18,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049156957] [2019-11-28 20:20:18,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:20:18,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:18,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:20:18,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:20:18,245 INFO L87 Difference]: Start difference. First operand 122 states and 144 transitions. Second operand 4 states. [2019-11-28 20:20:18,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:18,361 INFO L93 Difference]: Finished difference Result 191 states and 218 transitions. [2019-11-28 20:20:18,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:20:18,361 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-11-28 20:20:18,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:18,363 INFO L225 Difference]: With dead ends: 191 [2019-11-28 20:20:18,363 INFO L226 Difference]: Without dead ends: 191 [2019-11-28 20:20:18,365 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:20:18,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-11-28 20:20:18,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 137. [2019-11-28 20:20:18,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-11-28 20:20:18,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 161 transitions. [2019-11-28 20:20:18,370 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 161 transitions. Word has length 27 [2019-11-28 20:20:18,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:18,371 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 161 transitions. [2019-11-28 20:20:18,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:20:18,371 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 161 transitions. [2019-11-28 20:20:18,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 20:20:18,372 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:18,372 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:18,373 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:18,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:18,374 INFO L82 PathProgramCache]: Analyzing trace with hash -682632713, now seen corresponding path program 1 times [2019-11-28 20:20:18,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:18,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538681484] [2019-11-28 20:20:18,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:18,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:20:18,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:20:18,435 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:20:18,435 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 20:20:18,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:20:18 BoogieIcfgContainer [2019-11-28 20:20:18,491 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 20:20:18,491 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:20:18,491 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:20:18,492 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:20:18,492 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:20:03" (3/4) ... [2019-11-28 20:20:18,501 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 20:20:18,546 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 20:20:18,546 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:20:18,548 INFO L168 Benchmark]: Toolchain (without parser) took 16784.28 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 359.7 MB). Free memory was 952.3 MB in the beginning and 1.0 GB in the end (delta: -61.1 MB). Peak memory consumption was 298.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:20:18,549 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:20:18,549 INFO L168 Benchmark]: CACSL2BoogieTranslator took 637.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -181.5 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2019-11-28 20:20:18,550 INFO L168 Benchmark]: Boogie Preprocessor took 70.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:20:18,550 INFO L168 Benchmark]: RCFGBuilder took 794.05 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: 57.0 MB). Peak memory consumption was 57.0 MB. Max. memory is 11.5 GB. [2019-11-28 20:20:18,551 INFO L168 Benchmark]: TraceAbstraction took 15221.22 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 212.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 51.5 MB). Peak memory consumption was 264.3 MB. Max. memory is 11.5 GB. [2019-11-28 20:20:18,551 INFO L168 Benchmark]: Witness Printer took 54.59 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-11-28 20:20:18,554 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.29 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 637.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -181.5 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 70.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 794.05 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: 57.0 MB). Peak memory consumption was 57.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15221.22 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 212.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 51.5 MB). Peak memory consumption was 264.3 MB. Max. memory is 11.5 GB. * Witness Printer took 54.59 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1023]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L986] SLL* head = malloc(sizeof(SLL)); VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}] [L987] head->next = head VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}] [L988] head->data = 0 VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}] [L990] SLL* x = head; [L991] int state = 1; VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}] [L994] COND FALSE !(__VERIFIER_nondet_int()) [L1016] x->data = state VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}] [L1018] EXPR head->next VAL [head={-1:0}, head->next={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}] [L1018] x = head->next [L1019] COND FALSE !(!(((void*)0) != x)) VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}] [L1021] EXPR x->data VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}, x->data=1] [L1021] COND TRUE x->data != 0 [L1023] EXPR x->next VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}, x->next={-1:0}] [L1023] EXPR x->next->data VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}, x->next={-1:0}, x->next->data=1] [L1023] EXPR x->next->data != 0 && x->data > x->next->data VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data != 0 && x->data > x->next->data=1] [L1023] EXPR x->data VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next->data=1, x->next->data != 0 && x->data > x->next->data=1] [L1023] EXPR x->next VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data != 0 && x->data > x->next->data=1] [L1023] EXPR x->next->data VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data=1, x->next->data != 0 && x->data > x->next->data=1] [L1023] EXPR x->next->data != 0 && x->data > x->next->data VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data=1, x->next->data != 0 && x->data > x->next->data=0] [L1023] COND TRUE !(x->next->data != 0 && x->data > x->next->data) [L1023] __VERIFIER_error() VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 113 locations, 50 error locations. Result: UNSAFE, OverallTime: 15.0s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 11.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1602 SDtfs, 4376 SDslu, 4798 SDs, 0 SdLazy, 7438 SolverSat, 374 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 343 GetRequests, 73 SyntacticMatches, 6 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 766 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 484 NumberOfCodeBlocks, 484 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 432 ConstructedInterpolants, 0 QuantifiedInterpolants, 73116 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...