./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/forester-heap/sll-token-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_593552b4-8b69-4310-8db9-4508e5b0cea2/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_593552b4-8b69-4310-8db9-4508e5b0cea2/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_593552b4-8b69-4310-8db9-4508e5b0cea2/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_593552b4-8b69-4310-8db9-4508e5b0cea2/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-token-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_593552b4-8b69-4310-8db9-4508e5b0cea2/bin/uautomizer/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_593552b4-8b69-4310-8db9-4508e5b0cea2/bin/uautomizer --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 60dcf5da7f0124de96473d8010137f60c5cb2803 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-12-07 15:53:46,475 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 15:53:46,477 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 15:53:46,484 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 15:53:46,484 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 15:53:46,485 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 15:53:46,486 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 15:53:46,487 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 15:53:46,488 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 15:53:46,489 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 15:53:46,490 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 15:53:46,490 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 15:53:46,491 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 15:53:46,491 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 15:53:46,492 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 15:53:46,493 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 15:53:46,493 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 15:53:46,494 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 15:53:46,495 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 15:53:46,497 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 15:53:46,498 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 15:53:46,499 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 15:53:46,500 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 15:53:46,500 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 15:53:46,502 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 15:53:46,502 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 15:53:46,502 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 15:53:46,503 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 15:53:46,503 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 15:53:46,503 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 15:53:46,504 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 15:53:46,504 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 15:53:46,505 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 15:53:46,505 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 15:53:46,506 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 15:53:46,506 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 15:53:46,507 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 15:53:46,507 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 15:53:46,507 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 15:53:46,508 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 15:53:46,509 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 15:53:46,509 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_593552b4-8b69-4310-8db9-4508e5b0cea2/bin/uautomizer/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2019-12-07 15:53:46,522 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 15:53:46,522 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 15:53:46,523 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 15:53:46,523 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 15:53:46,523 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 15:53:46,524 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 15:53:46,524 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 15:53:46,524 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 15:53:46,524 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 15:53:46,524 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 15:53:46,524 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 15:53:46,525 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 15:53:46,525 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 15:53:46,525 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 15:53:46,525 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 15:53:46,525 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 15:53:46,526 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 15:53:46,526 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 15:53:46,526 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 15:53:46,526 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 15:53:46,526 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 15:53:46,526 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 15:53:46,527 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 15:53:46,527 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 15:53:46,527 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 15:53:46,527 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 15:53:46,527 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 15:53:46,528 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_593552b4-8b69-4310-8db9-4508e5b0cea2/bin/uautomizer 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 -> 60dcf5da7f0124de96473d8010137f60c5cb2803 [2019-12-07 15:53:46,633 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 15:53:46,643 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 15:53:46,646 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 15:53:46,647 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 15:53:46,647 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 15:53:46,648 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_593552b4-8b69-4310-8db9-4508e5b0cea2/bin/uautomizer/../../sv-benchmarks/c/forester-heap/sll-token-1.i [2019-12-07 15:53:46,690 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_593552b4-8b69-4310-8db9-4508e5b0cea2/bin/uautomizer/data/a33d8a600/f97e51475fe74f328abe706640526609/FLAG0c82c8040 [2019-12-07 15:53:47,145 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 15:53:47,145 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_593552b4-8b69-4310-8db9-4508e5b0cea2/sv-benchmarks/c/forester-heap/sll-token-1.i [2019-12-07 15:53:47,154 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_593552b4-8b69-4310-8db9-4508e5b0cea2/bin/uautomizer/data/a33d8a600/f97e51475fe74f328abe706640526609/FLAG0c82c8040 [2019-12-07 15:53:47,163 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_593552b4-8b69-4310-8db9-4508e5b0cea2/bin/uautomizer/data/a33d8a600/f97e51475fe74f328abe706640526609 [2019-12-07 15:53:47,165 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 15:53:47,166 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-07 15:53:47,166 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 15:53:47,166 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 15:53:47,169 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 15:53:47,169 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:53:47" (1/1) ... [2019-12-07 15:53:47,171 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b06cb05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:53:47, skipping insertion in model container [2019-12-07 15:53:47,171 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:53:47" (1/1) ... [2019-12-07 15:53:47,176 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 15:53:47,200 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 15:53:47,418 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:53:47,427 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 15:53:47,457 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:53:47,489 INFO L208 MainTranslator]: Completed translation [2019-12-07 15:53:47,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:53:47 WrapperNode [2019-12-07 15:53:47,490 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 15:53:47,490 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 15:53:47,490 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 15:53:47,490 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 15:53:47,499 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:53:47" (1/1) ... [2019-12-07 15:53:47,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:53:47" (1/1) ... [2019-12-07 15:53:47,511 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:53:47" (1/1) ... [2019-12-07 15:53:47,511 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:53:47" (1/1) ... [2019-12-07 15:53:47,528 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:53:47" (1/1) ... [2019-12-07 15:53:47,534 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:53:47" (1/1) ... [2019-12-07 15:53:47,538 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:53:47" (1/1) ... [2019-12-07 15:53:47,542 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 15:53:47,543 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 15:53:47,543 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 15:53:47,543 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 15:53:47,543 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:53:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_593552b4-8b69-4310-8db9-4508e5b0cea2/bin/uautomizer/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-12-07 15:53:47,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-12-07 15:53:47,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 15:53:47,584 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-12-07 15:53:47,584 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-12-07 15:53:47,584 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-12-07 15:53:47,584 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-12-07 15:53:47,584 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-12-07 15:53:47,585 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-12-07 15:53:47,585 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-12-07 15:53:47,585 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-12-07 15:53:47,585 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-12-07 15:53:47,585 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-12-07 15:53:47,585 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-12-07 15:53:47,585 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-12-07 15:53:47,585 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-12-07 15:53:47,586 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-12-07 15:53:47,586 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-12-07 15:53:47,586 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-12-07 15:53:47,586 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-12-07 15:53:47,586 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-12-07 15:53:47,586 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-12-07 15:53:47,586 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-12-07 15:53:47,587 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-12-07 15:53:47,587 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-12-07 15:53:47,587 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-12-07 15:53:47,587 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-12-07 15:53:47,587 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-12-07 15:53:47,587 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-12-07 15:53:47,587 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-12-07 15:53:47,588 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-12-07 15:53:47,588 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-12-07 15:53:47,588 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-12-07 15:53:47,588 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-12-07 15:53:47,588 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-12-07 15:53:47,588 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-12-07 15:53:47,588 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-12-07 15:53:47,588 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-12-07 15:53:47,588 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-12-07 15:53:47,588 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-12-07 15:53:47,588 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-12-07 15:53:47,588 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-12-07 15:53:47,589 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-12-07 15:53:47,589 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-12-07 15:53:47,589 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-12-07 15:53:47,589 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-12-07 15:53:47,589 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-12-07 15:53:47,589 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-12-07 15:53:47,589 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-12-07 15:53:47,589 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-12-07 15:53:47,589 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-12-07 15:53:47,589 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-12-07 15:53:47,589 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-12-07 15:53:47,589 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-12-07 15:53:47,589 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-12-07 15:53:47,589 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-12-07 15:53:47,590 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-12-07 15:53:47,590 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-12-07 15:53:47,590 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-12-07 15:53:47,590 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-12-07 15:53:47,590 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-12-07 15:53:47,590 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-12-07 15:53:47,590 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-12-07 15:53:47,590 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-12-07 15:53:47,590 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-12-07 15:53:47,590 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-12-07 15:53:47,590 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-12-07 15:53:47,590 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-12-07 15:53:47,591 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-12-07 15:53:47,591 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-12-07 15:53:47,591 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-12-07 15:53:47,591 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-12-07 15:53:47,591 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-12-07 15:53:47,591 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-12-07 15:53:47,591 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-12-07 15:53:47,591 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-12-07 15:53:47,591 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-12-07 15:53:47,592 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-12-07 15:53:47,592 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-12-07 15:53:47,592 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-12-07 15:53:47,592 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-12-07 15:53:47,592 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-12-07 15:53:47,592 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-12-07 15:53:47,592 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-12-07 15:53:47,593 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-12-07 15:53:47,593 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-12-07 15:53:47,593 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-12-07 15:53:47,593 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-12-07 15:53:47,593 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-12-07 15:53:47,593 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-12-07 15:53:47,593 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-12-07 15:53:47,594 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-12-07 15:53:47,594 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-12-07 15:53:47,594 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-12-07 15:53:47,594 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-12-07 15:53:47,594 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-12-07 15:53:47,594 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-12-07 15:53:47,594 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-12-07 15:53:47,594 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-12-07 15:53:47,594 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-12-07 15:53:47,594 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-12-07 15:53:47,595 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-12-07 15:53:47,595 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-12-07 15:53:47,595 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-12-07 15:53:47,595 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-12-07 15:53:47,595 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-12-07 15:53:47,595 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-12-07 15:53:47,595 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-12-07 15:53:47,595 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-12-07 15:53:47,595 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-12-07 15:53:47,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 15:53:47,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 15:53:47,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 15:53:47,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 15:53:47,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 15:53:47,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 15:53:47,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-12-07 15:53:47,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 15:53:47,931 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 15:53:47,931 INFO L287 CfgBuilder]: Removed 15 assume(true) statements. [2019-12-07 15:53:47,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:53:47 BoogieIcfgContainer [2019-12-07 15:53:47,932 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 15:53:47,933 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 15:53:47,933 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 15:53:47,935 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 15:53:47,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 03:53:47" (1/3) ... [2019-12-07 15:53:47,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12d1edb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:53:47, skipping insertion in model container [2019-12-07 15:53:47,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:53:47" (2/3) ... [2019-12-07 15:53:47,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12d1edb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:53:47, skipping insertion in model container [2019-12-07 15:53:47,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:53:47" (3/3) ... [2019-12-07 15:53:47,938 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-token-1.i [2019-12-07 15:53:47,944 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 15:53:47,949 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 54 error locations. [2019-12-07 15:53:47,958 INFO L249 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2019-12-07 15:53:47,972 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 15:53:47,972 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 15:53:47,972 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 15:53:47,972 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 15:53:47,973 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 15:53:47,973 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 15:53:47,973 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 15:53:47,973 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 15:53:47,988 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states. [2019-12-07 15:53:47,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 15:53:47,994 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:53:47,995 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:53:47,995 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr53ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19ASSERT_VIOLATIONMEMORY_LEAK, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_LEAK, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 15:53:47,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:53:47,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1914108980, now seen corresponding path program 1 times [2019-12-07 15:53:48,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:53:48,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081517294] [2019-12-07 15:53:48,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:53:48,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:53:48,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:53:48,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:53:48,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081517294] [2019-12-07 15:53:48,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:53:48,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:53:48,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096389411] [2019-12-07 15:53:48,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:53:48,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:53:48,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:53:48,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:53:48,154 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 4 states. [2019-12-07 15:53:48,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:53:48,343 INFO L93 Difference]: Finished difference Result 140 states and 143 transitions. [2019-12-07 15:53:48,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:53:48,344 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-07 15:53:48,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:53:48,351 INFO L225 Difference]: With dead ends: 140 [2019-12-07 15:53:48,351 INFO L226 Difference]: Without dead ends: 137 [2019-12-07 15:53:48,352 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-12-07 15:53:48,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-12-07 15:53:48,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 117. [2019-12-07 15:53:48,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-12-07 15:53:48,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 119 transitions. [2019-12-07 15:53:48,382 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 119 transitions. Word has length 7 [2019-12-07 15:53:48,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:53:48,383 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 119 transitions. [2019-12-07 15:53:48,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:53:48,383 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 119 transitions. [2019-12-07 15:53:48,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 15:53:48,383 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:53:48,383 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:53:48,384 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr53ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19ASSERT_VIOLATIONMEMORY_LEAK, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_LEAK, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 15:53:48,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:53:48,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1914108979, now seen corresponding path program 1 times [2019-12-07 15:53:48,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:53:48,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313256935] [2019-12-07 15:53:48,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:53:48,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:53:48,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:53:48,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:53:48,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313256935] [2019-12-07 15:53:48,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:53:48,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:53:48,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314777370] [2019-12-07 15:53:48,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:53:48,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:53:48,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:53:48,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:53:48,424 INFO L87 Difference]: Start difference. First operand 117 states and 119 transitions. Second operand 4 states. [2019-12-07 15:53:48,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:53:48,567 INFO L93 Difference]: Finished difference Result 143 states and 145 transitions. [2019-12-07 15:53:48,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:53:48,567 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-07 15:53:48,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:53:48,569 INFO L225 Difference]: With dead ends: 143 [2019-12-07 15:53:48,569 INFO L226 Difference]: Without dead ends: 143 [2019-12-07 15:53:48,570 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-12-07 15:53:48,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-12-07 15:53:48,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 115. [2019-12-07 15:53:48,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-12-07 15:53:48,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 117 transitions. [2019-12-07 15:53:48,580 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 117 transitions. Word has length 7 [2019-12-07 15:53:48,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:53:48,581 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 117 transitions. [2019-12-07 15:53:48,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:53:48,581 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2019-12-07 15:53:48,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 15:53:48,581 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:53:48,582 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:53:48,582 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr53ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19ASSERT_VIOLATIONMEMORY_LEAK, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_LEAK, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 15:53:48,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:53:48,582 INFO L82 PathProgramCache]: Analyzing trace with hash 889290307, now seen corresponding path program 1 times [2019-12-07 15:53:48,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:53:48,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426720651] [2019-12-07 15:53:48,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:53:48,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:53:48,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:53:48,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:53:48,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426720651] [2019-12-07 15:53:48,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:53:48,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:53:48,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97513172] [2019-12-07 15:53:48,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:53:48,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:53:48,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:53:48,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:53:48,633 INFO L87 Difference]: Start difference. First operand 115 states and 117 transitions. Second operand 5 states. [2019-12-07 15:53:48,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:53:48,796 INFO L93 Difference]: Finished difference Result 121 states and 124 transitions. [2019-12-07 15:53:48,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 15:53:48,796 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-12-07 15:53:48,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:53:48,797 INFO L225 Difference]: With dead ends: 121 [2019-12-07 15:53:48,797 INFO L226 Difference]: Without dead ends: 121 [2019-12-07 15:53:48,798 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-12-07 15:53:48,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-12-07 15:53:48,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 104. [2019-12-07 15:53:48,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-12-07 15:53:48,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 108 transitions. [2019-12-07 15:53:48,807 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 108 transitions. Word has length 12 [2019-12-07 15:53:48,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:53:48,807 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 108 transitions. [2019-12-07 15:53:48,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:53:48,808 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2019-12-07 15:53:48,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 15:53:48,808 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:53:48,808 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:53:48,809 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr53ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19ASSERT_VIOLATIONMEMORY_LEAK, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_LEAK, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 15:53:48,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:53:48,809 INFO L82 PathProgramCache]: Analyzing trace with hash 889290308, now seen corresponding path program 1 times [2019-12-07 15:53:48,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:53:48,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383815520] [2019-12-07 15:53:48,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:53:48,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:53:48,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:53:48,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:53:48,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383815520] [2019-12-07 15:53:48,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:53:48,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:53:48,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821130343] [2019-12-07 15:53:48,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:53:48,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:53:48,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:53:48,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:53:48,867 INFO L87 Difference]: Start difference. First operand 104 states and 108 transitions. Second operand 5 states. [2019-12-07 15:53:49,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:53:49,072 INFO L93 Difference]: Finished difference Result 184 states and 188 transitions. [2019-12-07 15:53:49,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:53:49,073 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-12-07 15:53:49,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:53:49,074 INFO L225 Difference]: With dead ends: 184 [2019-12-07 15:53:49,074 INFO L226 Difference]: Without dead ends: 184 [2019-12-07 15:53:49,074 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-12-07 15:53:49,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-12-07 15:53:49,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 133. [2019-12-07 15:53:49,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-12-07 15:53:49,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 144 transitions. [2019-12-07 15:53:49,082 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 144 transitions. Word has length 12 [2019-12-07 15:53:49,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:53:49,082 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 144 transitions. [2019-12-07 15:53:49,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:53:49,082 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 144 transitions. [2019-12-07 15:53:49,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 15:53:49,082 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:53:49,082 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:53:49,083 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr53ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19ASSERT_VIOLATIONMEMORY_LEAK, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_LEAK, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 15:53:49,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:53:49,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1490170776, now seen corresponding path program 1 times [2019-12-07 15:53:49,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:53:49,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804347184] [2019-12-07 15:53:49,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:53:49,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:53:49,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:53:49,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:53:49,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804347184] [2019-12-07 15:53:49,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:53:49,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 15:53:49,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617339686] [2019-12-07 15:53:49,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 15:53:49,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:53:49,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 15:53:49,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 15:53:49,135 INFO L87 Difference]: Start difference. First operand 133 states and 144 transitions. Second operand 7 states. [2019-12-07 15:53:49,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:53:49,408 INFO L93 Difference]: Finished difference Result 200 states and 216 transitions. [2019-12-07 15:53:49,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 15:53:49,409 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-07 15:53:49,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:53:49,410 INFO L225 Difference]: With dead ends: 200 [2019-12-07 15:53:49,410 INFO L226 Difference]: Without dead ends: 200 [2019-12-07 15:53:49,411 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-07 15:53:49,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-12-07 15:53:49,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 132. [2019-12-07 15:53:49,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-12-07 15:53:49,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 143 transitions. [2019-12-07 15:53:49,418 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 143 transitions. Word has length 15 [2019-12-07 15:53:49,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:53:49,419 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 143 transitions. [2019-12-07 15:53:49,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 15:53:49,419 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 143 transitions. [2019-12-07 15:53:49,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 15:53:49,419 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:53:49,419 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:53:49,419 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr53ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19ASSERT_VIOLATIONMEMORY_LEAK, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_LEAK, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 15:53:49,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:53:49,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1490170777, now seen corresponding path program 1 times [2019-12-07 15:53:49,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:53:49,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740736384] [2019-12-07 15:53:49,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:53:49,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:53:49,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:53:49,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:53:49,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740736384] [2019-12-07 15:53:49,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:53:49,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 15:53:49,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991699222] [2019-12-07 15:53:49,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 15:53:49,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:53:49,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 15:53:49,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 15:53:49,481 INFO L87 Difference]: Start difference. First operand 132 states and 143 transitions. Second operand 7 states. [2019-12-07 15:53:49,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:53:49,803 INFO L93 Difference]: Finished difference Result 222 states and 242 transitions. [2019-12-07 15:53:49,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 15:53:49,803 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-07 15:53:49,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:53:49,804 INFO L225 Difference]: With dead ends: 222 [2019-12-07 15:53:49,804 INFO L226 Difference]: Without dead ends: 222 [2019-12-07 15:53:49,805 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-12-07 15:53:49,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-12-07 15:53:49,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 118. [2019-12-07 15:53:49,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-12-07 15:53:49,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 128 transitions. [2019-12-07 15:53:49,809 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 128 transitions. Word has length 15 [2019-12-07 15:53:49,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:53:49,809 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 128 transitions. [2019-12-07 15:53:49,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 15:53:49,809 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 128 transitions. [2019-12-07 15:53:49,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 15:53:49,810 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:53:49,810 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:53:49,810 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr53ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19ASSERT_VIOLATIONMEMORY_LEAK, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_LEAK, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 15:53:49,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:53:49,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1077022969, now seen corresponding path program 1 times [2019-12-07 15:53:49,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:53:49,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562598962] [2019-12-07 15:53:49,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:53:49,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:53:49,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:53:49,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:53:49,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562598962] [2019-12-07 15:53:49,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:53:49,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 15:53:49,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386712621] [2019-12-07 15:53:49,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 15:53:49,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:53:49,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 15:53:49,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 15:53:49,849 INFO L87 Difference]: Start difference. First operand 118 states and 128 transitions. Second operand 6 states. [2019-12-07 15:53:49,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:53:49,989 INFO L93 Difference]: Finished difference Result 125 states and 131 transitions. [2019-12-07 15:53:49,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 15:53:49,990 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-12-07 15:53:49,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:53:49,991 INFO L225 Difference]: With dead ends: 125 [2019-12-07 15:53:49,991 INFO L226 Difference]: Without dead ends: 125 [2019-12-07 15:53:49,991 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-12-07 15:53:49,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-12-07 15:53:49,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 117. [2019-12-07 15:53:49,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-12-07 15:53:49,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 127 transitions. [2019-12-07 15:53:49,995 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 127 transitions. Word has length 16 [2019-12-07 15:53:49,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:53:49,995 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 127 transitions. [2019-12-07 15:53:49,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 15:53:49,995 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 127 transitions. [2019-12-07 15:53:49,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 15:53:49,995 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:53:49,996 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:53:49,996 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr53ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19ASSERT_VIOLATIONMEMORY_LEAK, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_LEAK, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 15:53:49,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:53:49,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1077022968, now seen corresponding path program 1 times [2019-12-07 15:53:49,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:53:49,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976266329] [2019-12-07 15:53:49,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:53:50,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:53:50,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:53:50,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:53:50,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976266329] [2019-12-07 15:53:50,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:53:50,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 15:53:50,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285820740] [2019-12-07 15:53:50,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 15:53:50,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:53:50,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 15:53:50,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 15:53:50,044 INFO L87 Difference]: Start difference. First operand 117 states and 127 transitions. Second operand 6 states. [2019-12-07 15:53:50,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:53:50,192 INFO L93 Difference]: Finished difference Result 116 states and 126 transitions. [2019-12-07 15:53:50,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 15:53:50,192 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-12-07 15:53:50,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:53:50,193 INFO L225 Difference]: With dead ends: 116 [2019-12-07 15:53:50,193 INFO L226 Difference]: Without dead ends: 116 [2019-12-07 15:53:50,194 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-12-07 15:53:50,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-12-07 15:53:50,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2019-12-07 15:53:50,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-12-07 15:53:50,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 126 transitions. [2019-12-07 15:53:50,197 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 126 transitions. Word has length 16 [2019-12-07 15:53:50,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:53:50,197 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 126 transitions. [2019-12-07 15:53:50,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 15:53:50,198 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 126 transitions. [2019-12-07 15:53:50,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 15:53:50,198 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:53:50,198 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:53:50,198 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr53ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19ASSERT_VIOLATIONMEMORY_LEAK, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_LEAK, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 15:53:50,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:53:50,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1830006328, now seen corresponding path program 1 times [2019-12-07 15:53:50,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:53:50,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558366651] [2019-12-07 15:53:50,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:53:50,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:53:50,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:53:50,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:53:50,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558366651] [2019-12-07 15:53:50,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:53:50,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 15:53:50,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400913688] [2019-12-07 15:53:50,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 15:53:50,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:53:50,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 15:53:50,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 15:53:50,251 INFO L87 Difference]: Start difference. First operand 116 states and 126 transitions. Second operand 7 states. [2019-12-07 15:53:50,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:53:50,510 INFO L93 Difference]: Finished difference Result 216 states and 236 transitions. [2019-12-07 15:53:50,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 15:53:50,511 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-12-07 15:53:50,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:53:50,512 INFO L225 Difference]: With dead ends: 216 [2019-12-07 15:53:50,512 INFO L226 Difference]: Without dead ends: 216 [2019-12-07 15:53:50,512 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-12-07 15:53:50,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-12-07 15:53:50,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 114. [2019-12-07 15:53:50,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-12-07 15:53:50,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 124 transitions. [2019-12-07 15:53:50,515 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 124 transitions. Word has length 17 [2019-12-07 15:53:50,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:53:50,515 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 124 transitions. [2019-12-07 15:53:50,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 15:53:50,515 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 124 transitions. [2019-12-07 15:53:50,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 15:53:50,516 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:53:50,516 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:53:50,516 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr53ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19ASSERT_VIOLATIONMEMORY_LEAK, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_LEAK, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 15:53:50,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:53:50,516 INFO L82 PathProgramCache]: Analyzing trace with hash 2109432891, now seen corresponding path program 1 times [2019-12-07 15:53:50,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:53:50,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675990462] [2019-12-07 15:53:50,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:53:50,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:53:50,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:53:50,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:53:50,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675990462] [2019-12-07 15:53:50,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:53:50,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 15:53:50,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543042933] [2019-12-07 15:53:50,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:53:50,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:53:50,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:53:50,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:53:50,545 INFO L87 Difference]: Start difference. First operand 114 states and 124 transitions. Second operand 5 states. [2019-12-07 15:53:50,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:53:50,680 INFO L93 Difference]: Finished difference Result 168 states and 173 transitions. [2019-12-07 15:53:50,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 15:53:50,680 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-07 15:53:50,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:53:50,681 INFO L225 Difference]: With dead ends: 168 [2019-12-07 15:53:50,681 INFO L226 Difference]: Without dead ends: 168 [2019-12-07 15:53:50,681 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-12-07 15:53:50,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-12-07 15:53:50,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 112. [2019-12-07 15:53:50,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-12-07 15:53:50,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2019-12-07 15:53:50,684 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 19 [2019-12-07 15:53:50,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:53:50,684 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2019-12-07 15:53:50,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:53:50,684 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2019-12-07 15:53:50,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 15:53:50,684 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:53:50,685 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-12-07 15:53:50,685 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr53ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19ASSERT_VIOLATIONMEMORY_LEAK, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_LEAK, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 15:53:50,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:53:50,685 INFO L82 PathProgramCache]: Analyzing trace with hash -857536838, now seen corresponding path program 1 times [2019-12-07 15:53:50,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:53:50,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958863592] [2019-12-07 15:53:50,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:53:50,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:53:50,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:53:50,728 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 15:53:50,729 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 15:53:50,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 03:53:50 BoogieIcfgContainer [2019-12-07 15:53:50,749 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 15:53:50,749 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 15:53:50,749 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 15:53:50,749 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 15:53:50,749 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:53:47" (3/4) ... [2019-12-07 15:53:50,751 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 15:53:50,783 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_593552b4-8b69-4310-8db9-4508e5b0cea2/bin/uautomizer/witness.graphml [2019-12-07 15:53:50,783 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 15:53:50,784 INFO L168 Benchmark]: Toolchain (without parser) took 3618.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 934.4 MB in the beginning and 1.0 GB in the end (delta: -99.3 MB). Peak memory consumption was 56.4 MB. Max. memory is 11.5 GB. [2019-12-07 15:53:50,785 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:53:50,785 INFO L168 Benchmark]: CACSL2BoogieTranslator took 323.88 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.4 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -155.0 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-12-07 15:53:50,785 INFO L168 Benchmark]: Boogie Preprocessor took 52.06 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 15:53:50,786 INFO L168 Benchmark]: RCFGBuilder took 389.62 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. [2019-12-07 15:53:50,786 INFO L168 Benchmark]: TraceAbstraction took 2815.69 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 50.3 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -19.6 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. [2019-12-07 15:53:50,786 INFO L168 Benchmark]: Witness Printer took 34.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. [2019-12-07 15:53:50,788 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 323.88 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.4 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -155.0 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.06 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 389.62 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2815.69 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 50.3 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -19.6 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. * Witness Printer took 34.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1020]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L992] SLL* head = malloc(sizeof(SLL)); VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}] [L993] head->next = ((void*)0) VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}] [L994] head->data = 0 VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}] [L996] SLL* x = head; VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, x={-1:0}] [L999] COND FALSE !(__VERIFIER_nondet_int()) [L1007] x->data = 1 VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, x={-1:0}] [L1008] x->next = malloc(sizeof(SLL)) VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, x={-1:0}] [L1009] EXPR x->next VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, x={-1:0}, x->next={-2:0}] [L1009] x->next->data = 2 VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, x={-1:0}, x->next={-2:0}] [L1011] x = head VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, x={-1:0}] [L1013] COND FALSE !(!(((void*)0) != x)) VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, x={-1:0}] [L1015] EXPR x->data VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, x={-1:0}, x->data=1] [L1015] COND FALSE !(1 != x->data) [L1020] EXPR x->data VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, x={-1:0}, x->data=1] [L1020] COND TRUE !(2 == x->data) [L1020] __VERIFIER_error() VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, x={-1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 122 locations, 54 error locations. Result: UNSAFE, OverallTime: 2.7s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 869 SDtfs, 1165 SDslu, 1440 SDs, 0 SdLazy, 2712 SolverSat, 107 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 454 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 160 NumberOfCodeBlocks, 160 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 126 ConstructedInterpolants, 0 QuantifiedInterpolants, 6202 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...